./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/nla-digbench-scaling/cohencu-ll_unwindbound20.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 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 00:14:51,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 00:14:51,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 00:14:51,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 00:14:51,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 00:14:51,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 00:14:51,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 00:14:51,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 00:14:51,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 00:14:51,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 00:14:51,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 00:14:51,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 00:14:51,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 00:14:51,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 00:14:51,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 00:14:51,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 00:14:51,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 00:14:51,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 00:14:51,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 00:14:51,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 00:14:51,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 00:14:51,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 00:14:51,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 00:14:51,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 00:14:51,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 00:14:51,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 00:14:51,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 00:14:51,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 00:14:51,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 00:14:51,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 00:14:51,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 00:14:51,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 00:14:51,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 00:14:51,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 00:14:51,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 00:14:51,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 00:14:51,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 00:14:51,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 00:14:51,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 00:14:51,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 00:14:51,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 00:14:51,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 00:14:51,381 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 00:14:51,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 00:14:51,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 00:14:51,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 00:14:51,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 00:14:51,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 00:14:51,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 00:14:51,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 00:14:51,383 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 00:14:51,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 00:14:51,384 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 00:14:51,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 00:14:51,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 00:14:51,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 00:14:51,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 00:14:51,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 00:14:51,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 00:14:51,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 00:14:51,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:14:51,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 00:14:51,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 00:14:51,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 00:14:51,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 00:14:51,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 00:14:51,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 00:14:51,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 00:14:51,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 00:14:51,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 00:14:51,389 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 -> 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb [2021-12-16 00:14:51,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 00:14:51,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 00:14:51,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 00:14:51,607 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 00:14:51,608 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 00:14:51,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2021-12-16 00:14:51,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93015d871/a3a50c710fd1479496b2047e78a77d94/FLAG75d645dc9 [2021-12-16 00:14:52,006 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 00:14:52,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2021-12-16 00:14:52,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93015d871/a3a50c710fd1479496b2047e78a77d94/FLAG75d645dc9 [2021-12-16 00:14:52,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93015d871/a3a50c710fd1479496b2047e78a77d94 [2021-12-16 00:14:52,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 00:14:52,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 00:14:52,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 00:14:52,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 00:14:52,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 00:14:52,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c06f368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52, skipping insertion in model container [2021-12-16 00:14:52,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 00:14:52,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 00:14:52,156 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/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2021-12-16 00:14:52,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:14:52,178 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 00:14:52,186 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/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2021-12-16 00:14:52,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:14:52,201 INFO L208 MainTranslator]: Completed translation [2021-12-16 00:14:52,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52 WrapperNode [2021-12-16 00:14:52,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 00:14:52,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 00:14:52,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 00:14:52,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 00:14:52,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,224 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2021-12-16 00:14:52,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 00:14:52,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 00:14:52,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 00:14:52,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 00:14:52,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 00:14:52,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 00:14:52,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 00:14:52,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 00:14:52,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (1/1) ... [2021-12-16 00:14:52,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:14:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:52,301 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-16 00:14:52,341 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-16 00:14:52,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 00:14:52,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 00:14:52,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 00:14:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 00:14:52,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 00:14:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 00:14:52,420 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 00:14:52,421 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 00:14:52,520 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 00:14:52,524 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 00:14:52,524 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 00:14:52,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:52 BoogieIcfgContainer [2021-12-16 00:14:52,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 00:14:52,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 00:14:52,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 00:14:52,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 00:14:52,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:14:52" (1/3) ... [2021-12-16 00:14:52,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603faa56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:14:52, skipping insertion in model container [2021-12-16 00:14:52,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:52" (2/3) ... [2021-12-16 00:14:52,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603faa56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:14:52, skipping insertion in model container [2021-12-16 00:14:52,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:52" (3/3) ... [2021-12-16 00:14:52,531 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2021-12-16 00:14:52,534 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 00:14:52,534 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 00:14:52,561 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 00:14:52,566 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-16 00:14:52,566 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 00:14:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-16 00:14:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 00:14:52,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:52,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:52,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2021-12-16 00:14:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723348453] [2021-12-16 00:14:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:52,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:52,678 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-16 00:14:52,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:52,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723348453] [2021-12-16 00:14:52,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723348453] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:52,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:52,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 00:14:52,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979567993] [2021-12-16 00:14:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:52,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 00:14:52,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 00:14:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 00:14:52,708 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:52,727 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2021-12-16 00:14:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 00:14:52,729 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 00:14:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:52,734 INFO L225 Difference]: With dead ends: 50 [2021-12-16 00:14:52,734 INFO L226 Difference]: Without dead ends: 22 [2021-12-16 00:14:52,737 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-16 00:14:52,740 INFO L933 BasicCegarLoop]: 37 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, 37 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-16 00:14:52,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-16 00:14:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-16 00:14:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-16 00:14:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2021-12-16 00:14:52,767 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2021-12-16 00:14:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:52,768 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2021-12-16 00:14:52,768 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2021-12-16 00:14:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 00:14:52,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:52,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:52,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 00:14:52,771 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2021-12-16 00:14:52,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193257051] [2021-12-16 00:14:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:52,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:52,830 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-16 00:14:52,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:52,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193257051] [2021-12-16 00:14:52,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193257051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:52,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:52,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 00:14:52,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464579546] [2021-12-16 00:14:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:52,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 00:14:52,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 00:14:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 00:14:52,833 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:52,846 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2021-12-16 00:14:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 00:14:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 00:14:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:52,847 INFO L225 Difference]: With dead ends: 36 [2021-12-16 00:14:52,847 INFO L226 Difference]: Without dead ends: 24 [2021-12-16 00:14:52,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 00:14:52,848 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:52,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-16 00:14:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-16 00:14:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-16 00:14:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2021-12-16 00:14:52,853 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2021-12-16 00:14:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:52,854 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-12-16 00:14:52,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2021-12-16 00:14:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 00:14:52,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:52,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:52,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 00:14:52,855 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2021-12-16 00:14:52,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:52,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678003786] [2021-12-16 00:14:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:52,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:52,915 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-16 00:14:52,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:52,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678003786] [2021-12-16 00:14:52,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678003786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:52,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:52,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 00:14:52,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507208118] [2021-12-16 00:14:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:52,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 00:14:52,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 00:14:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:14:52,918 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:52,974 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2021-12-16 00:14:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 00:14:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 00:14:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:52,975 INFO L225 Difference]: With dead ends: 30 [2021-12-16 00:14:52,976 INFO L226 Difference]: Without dead ends: 28 [2021-12-16 00:14:52,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 00:14:52,977 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:52,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-16 00:14:52,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-16 00:14:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-16 00:14:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-12-16 00:14:52,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2021-12-16 00:14:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:52,984 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-12-16 00:14:52,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 00:14:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-12-16 00:14:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 00:14:52,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:52,985 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:52,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 00:14:52,985 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2021-12-16 00:14:52,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:52,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006359102] [2021-12-16 00:14:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:52,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:52,995 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:52,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863259164] [2021-12-16 00:14:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:52,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:52,997 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-16 00:14:52,997 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-16 00:14:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:53,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 00:14:53,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 00:14:53,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 00:14:53,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006359102] [2021-12-16 00:14:53,106 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863259164] [2021-12-16 00:14:53,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863259164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:53,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:53,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 00:14:53,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790384440] [2021-12-16 00:14:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:53,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 00:14:53,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 00:14:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:14:53,108 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-16 00:14:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:53,147 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2021-12-16 00:14:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 00:14:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-16 00:14:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:53,148 INFO L225 Difference]: With dead ends: 46 [2021-12-16 00:14:53,148 INFO L226 Difference]: Without dead ends: 44 [2021-12-16 00:14:53,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 00:14:53,149 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:53,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-16 00:14:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2021-12-16 00:14:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-16 00:14:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-16 00:14:53,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2021-12-16 00:14:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:53,158 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-16 00:14:53,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-16 00:14:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2021-12-16 00:14:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 00:14:53,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:53,159 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:53,178 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-16 00:14:53,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:53,374 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:53,375 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2021-12-16 00:14:53,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:53,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138018650] [2021-12-16 00:14:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:53,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:53,384 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:53,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093344356] [2021-12-16 00:14:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:53,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:53,385 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-16 00:14:53,387 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-16 00:14:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:53,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 00:14:53,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 00:14:53,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 00:14:53,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138018650] [2021-12-16 00:14:53,482 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093344356] [2021-12-16 00:14:53,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093344356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:53,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:53,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 00:14:53,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091921441] [2021-12-16 00:14:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:53,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 00:14:53,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 00:14:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:14:53,484 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 00:14:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:53,521 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2021-12-16 00:14:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 00:14:53,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-12-16 00:14:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:53,522 INFO L225 Difference]: With dead ends: 50 [2021-12-16 00:14:53,522 INFO L226 Difference]: Without dead ends: 48 [2021-12-16 00:14:53,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 00:14:53,523 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:53,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-16 00:14:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2021-12-16 00:14:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-16 00:14:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2021-12-16 00:14:53,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2021-12-16 00:14:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:53,531 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2021-12-16 00:14:53,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 00:14:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2021-12-16 00:14:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 00:14:53,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:53,532 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:53,550 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-16 00:14:53,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:53,747 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2021-12-16 00:14:53,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263597195] [2021-12-16 00:14:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:53,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:53,758 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:53,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170530288] [2021-12-16 00:14:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:53,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:53,784 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-16 00:14:53,799 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-16 00:14:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:53,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 00:14:53,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:14:53,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 00:14:53,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:53,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263597195] [2021-12-16 00:14:53,901 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170530288] [2021-12-16 00:14:53,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170530288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:53,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:53,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 00:14:53,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965008068] [2021-12-16 00:14:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:53,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 00:14:53,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 00:14:53,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:14:53,903 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 00:14:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:53,946 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2021-12-16 00:14:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 00:14:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2021-12-16 00:14:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:53,947 INFO L225 Difference]: With dead ends: 58 [2021-12-16 00:14:53,947 INFO L226 Difference]: Without dead ends: 46 [2021-12-16 00:14:53,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 00:14:53,948 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:53,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-16 00:14:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-16 00:14:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-16 00:14:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2021-12-16 00:14:53,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2021-12-16 00:14:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:53,954 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-12-16 00:14:53,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 00:14:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2021-12-16 00:14:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 00:14:53,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:53,956 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:53,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-16 00:14:54,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:54,164 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2021-12-16 00:14:54,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331613441] [2021-12-16 00:14:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:54,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:54,174 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346675086] [2021-12-16 00:14:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:54,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:54,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:54,175 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-16 00:14:54,207 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-16 00:14:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:54,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 00:14:54,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-16 00:14:54,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 00:14:54,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:54,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331613441] [2021-12-16 00:14:54,432 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:54,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346675086] [2021-12-16 00:14:54,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346675086] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:54,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:54,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-16 00:14:54,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713025726] [2021-12-16 00:14:54,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:54,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:14:54,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:14:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:14:54,435 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:14:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:54,538 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2021-12-16 00:14:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 00:14:54,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2021-12-16 00:14:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:54,539 INFO L225 Difference]: With dead ends: 116 [2021-12-16 00:14:54,540 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 00:14:54,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:14:54,541 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:54,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:14:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 00:14:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-12-16 00:14:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-16 00:14:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2021-12-16 00:14:54,567 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 41 [2021-12-16 00:14:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:54,568 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2021-12-16 00:14:54,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:14:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2021-12-16 00:14:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 00:14:54,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:54,569 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:54,585 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-16 00:14:54,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:54,773 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2021-12-16 00:14:54,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433541381] [2021-12-16 00:14:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:54,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:54,780 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:54,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097835822] [2021-12-16 00:14:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:54,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:54,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:54,808 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-16 00:14:54,808 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-16 00:14:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:54,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 00:14:54,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 00:14:54,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 00:14:55,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:55,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433541381] [2021-12-16 00:14:55,052 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:55,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097835822] [2021-12-16 00:14:55,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097835822] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:55,052 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:55,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-16 00:14:55,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053101293] [2021-12-16 00:14:55,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:55,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:14:55,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:55,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:14:55,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:14:55,054 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 00:14:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:55,266 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2021-12-16 00:14:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 00:14:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2021-12-16 00:14:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:55,269 INFO L225 Difference]: With dead ends: 114 [2021-12-16 00:14:55,269 INFO L226 Difference]: Without dead ends: 112 [2021-12-16 00:14:55,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:14:55,270 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:55,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:14:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-16 00:14:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-16 00:14:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-16 00:14:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2021-12-16 00:14:55,282 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2021-12-16 00:14:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:55,282 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2021-12-16 00:14:55,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 00:14:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2021-12-16 00:14:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-16 00:14:55,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:55,284 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:55,302 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-16 00:14:55,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:55,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2021-12-16 00:14:55,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:55,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113570455] [2021-12-16 00:14:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:55,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:55,509 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759700244] [2021-12-16 00:14:55,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 00:14:55,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:55,512 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-16 00:14:55,513 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-16 00:14:55,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 00:14:55,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:14:55,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 00:14:55,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-16 00:14:55,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-16 00:14:55,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:55,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113570455] [2021-12-16 00:14:55,779 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:55,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759700244] [2021-12-16 00:14:55,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759700244] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:55,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:55,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-16 00:14:55,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871572797] [2021-12-16 00:14:55,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:55,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:14:55,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:14:55,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:14:55,783 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-16 00:14:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:55,877 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2021-12-16 00:14:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 00:14:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2021-12-16 00:14:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:55,880 INFO L225 Difference]: With dead ends: 118 [2021-12-16 00:14:55,880 INFO L226 Difference]: Without dead ends: 116 [2021-12-16 00:14:55,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-16 00:14:55,883 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:55,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 241 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:14:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-16 00:14:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-16 00:14:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-16 00:14:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-12-16 00:14:55,911 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 46 [2021-12-16 00:14:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:55,914 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-12-16 00:14:55,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-16 00:14:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-12-16 00:14:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-16 00:14:55,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:55,917 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:55,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:56,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:56,128 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2021-12-16 00:14:56,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:56,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876756174] [2021-12-16 00:14:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:56,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:56,137 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:56,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769607811] [2021-12-16 00:14:56,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 00:14:56,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:56,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:14:56,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 00:14:56,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-16 00:14:56,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:14:56,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 00:14:56,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-16 00:14:56,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-16 00:14:56,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:56,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876756174] [2021-12-16 00:14:56,579 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769607811] [2021-12-16 00:14:56,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769607811] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:56,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:56,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-16 00:14:56,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895624607] [2021-12-16 00:14:56,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:56,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:14:56,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:14:56,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:14:56,580 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-16 00:14:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:56,839 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2021-12-16 00:14:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 00:14:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2021-12-16 00:14:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:56,840 INFO L225 Difference]: With dead ends: 142 [2021-12-16 00:14:56,840 INFO L226 Difference]: Without dead ends: 131 [2021-12-16 00:14:56,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:14:56,841 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:56,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:14:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-16 00:14:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-16 00:14:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 00:14:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2021-12-16 00:14:56,850 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 51 [2021-12-16 00:14:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:56,850 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2021-12-16 00:14:56,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-16 00:14:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2021-12-16 00:14:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 00:14:56,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:56,851 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:56,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:57,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:57,067 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2021-12-16 00:14:57,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:57,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312374697] [2021-12-16 00:14:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:57,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:57,081 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:57,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016375826] [2021-12-16 00:14:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:57,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:57,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:14:57,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 00:14:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:57,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 00:14:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-12-16 00:14:57,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:57,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312374697] [2021-12-16 00:14:57,587 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016375826] [2021-12-16 00:14:57,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016375826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:14:57,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:14:57,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-12-16 00:14:57,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555986185] [2021-12-16 00:14:57,588 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:57,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:14:57,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:14:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:14:57,591 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:14:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:57,717 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2021-12-16 00:14:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 00:14:57,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2021-12-16 00:14:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:57,719 INFO L225 Difference]: With dead ends: 137 [2021-12-16 00:14:57,719 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 00:14:57,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-16 00:14:57,719 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:57,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:14:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 00:14:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-16 00:14:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 29 states have call successors, (29), 22 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 00:14:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-12-16 00:14:57,728 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 67 [2021-12-16 00:14:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:57,729 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-12-16 00:14:57,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:14:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-12-16 00:14:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-16 00:14:57,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:57,736 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:57,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:57,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-16 00:14:57,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1808123650, now seen corresponding path program 1 times [2021-12-16 00:14:57,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:57,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35831199] [2021-12-16 00:14:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:57,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:57,960 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:57,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697270774] [2021-12-16 00:14:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:57,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:57,962 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:14:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 00:14:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:58,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 00:14:58,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-12-16 00:14:58,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:58,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:58,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35831199] [2021-12-16 00:14:58,495 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:58,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697270774] [2021-12-16 00:14:58,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697270774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:14:58,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:14:58,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-12-16 00:14:58,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310291839] [2021-12-16 00:14:58,496 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:58,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:14:58,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:58,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:14:58,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:14:58,496 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:14:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:58,568 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2021-12-16 00:14:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 00:14:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2021-12-16 00:14:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:58,569 INFO L225 Difference]: With dead ends: 135 [2021-12-16 00:14:58,569 INFO L226 Difference]: Without dead ends: 124 [2021-12-16 00:14:58,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-16 00:14:58,570 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:58,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 205 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 00:14:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-16 00:14:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-16 00:14:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-16 00:14:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2021-12-16 00:14:58,578 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 72 [2021-12-16 00:14:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:58,579 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2021-12-16 00:14:58,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:14:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2021-12-16 00:14:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 00:14:58,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:58,584 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-16 00:14:58,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:58,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:58,785 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -207258189, now seen corresponding path program 4 times [2021-12-16 00:14:58,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:58,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647639845] [2021-12-16 00:14:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:58,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:58,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137276923] [2021-12-16 00:14:58,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 00:14:58,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:58,820 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:14:58,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 00:14:58,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 00:14:58,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:14:58,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-16 00:14:58,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 69 proven. 76 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-12-16 00:14:59,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 97 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-12-16 00:14:59,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:59,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647639845] [2021-12-16 00:14:59,627 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137276923] [2021-12-16 00:14:59,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137276923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:59,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:59,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-12-16 00:14:59,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840270375] [2021-12-16 00:14:59,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:59,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 00:14:59,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 00:14:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-16 00:14:59,629 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2021-12-16 00:14:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:59,955 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2021-12-16 00:14:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 00:14:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 74 [2021-12-16 00:14:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:59,956 INFO L225 Difference]: With dead ends: 134 [2021-12-16 00:14:59,956 INFO L226 Difference]: Without dead ends: 132 [2021-12-16 00:14:59,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-16 00:14:59,957 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:59,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 00:14:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-16 00:14:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2021-12-16 00:14:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-16 00:14:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-12-16 00:14:59,964 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2021-12-16 00:14:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:59,965 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-12-16 00:14:59,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2021-12-16 00:14:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-12-16 00:14:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 00:14:59,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:59,966 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:59,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:00,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-16 00:15:00,167 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 308615369, now seen corresponding path program 2 times [2021-12-16 00:15:00,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:00,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746198682] [2021-12-16 00:15:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:00,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:00,173 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:00,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898325483] [2021-12-16 00:15:00,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 00:15:00,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:00,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:00,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 00:15:00,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 00:15:00,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:00,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 00:15:00,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2021-12-16 00:15:00,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:00,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746198682] [2021-12-16 00:15:00,764 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898325483] [2021-12-16 00:15:00,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898325483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:15:00,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:15:00,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-12-16 00:15:00,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385206992] [2021-12-16 00:15:00,764 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:00,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:15:00,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:15:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:15:00,765 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-16 00:15:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:00,839 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-12-16 00:15:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:15:00,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2021-12-16 00:15:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:00,840 INFO L225 Difference]: With dead ends: 134 [2021-12-16 00:15:00,840 INFO L226 Difference]: Without dead ends: 132 [2021-12-16 00:15:00,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-16 00:15:00,841 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:00,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 249 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:15:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-16 00:15:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2021-12-16 00:15:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-16 00:15:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2021-12-16 00:15:00,847 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 95 [2021-12-16 00:15:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:00,848 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2021-12-16 00:15:00,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-16 00:15:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2021-12-16 00:15:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 00:15:00,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:00,849 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:00,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:01,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-16 00:15:01,066 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 75049244, now seen corresponding path program 2 times [2021-12-16 00:15:01,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:01,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154073400] [2021-12-16 00:15:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:01,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:01,072 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527312109] [2021-12-16 00:15:01,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 00:15:01,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:01,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:01,077 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 00:15:01,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 00:15:01,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:01,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 00:15:01,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2021-12-16 00:15:01,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:01,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154073400] [2021-12-16 00:15:01,527 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:01,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527312109] [2021-12-16 00:15:01,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527312109] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:15:01,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:15:01,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-12-16 00:15:01,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439427205] [2021-12-16 00:15:01,528 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:01,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:15:01,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:15:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:15:01,529 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-16 00:15:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:01,630 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-12-16 00:15:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:15:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2021-12-16 00:15:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:01,631 INFO L225 Difference]: With dead ends: 138 [2021-12-16 00:15:01,631 INFO L226 Difference]: Without dead ends: 125 [2021-12-16 00:15:01,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-16 00:15:01,632 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:01,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:15:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-16 00:15:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-16 00:15:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-16 00:15:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2021-12-16 00:15:01,639 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 100 [2021-12-16 00:15:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:01,639 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2021-12-16 00:15:01,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-16 00:15:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2021-12-16 00:15:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-16 00:15:01,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:01,640 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:01,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:01,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-16 00:15:01,858 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1859389073, now seen corresponding path program 3 times [2021-12-16 00:15:01,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240539458] [2021-12-16 00:15:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:01,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:01,864 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:01,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157711387] [2021-12-16 00:15:01,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 00:15:01,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:01,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-16 00:15:02,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-16 00:15:02,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 00:15:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2021-12-16 00:15:03,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:03,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:03,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240539458] [2021-12-16 00:15:03,575 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157711387] [2021-12-16 00:15:03,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157711387] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:15:03,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:15:03,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-12-16 00:15:03,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345988315] [2021-12-16 00:15:03,575 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:03,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:15:03,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:15:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:15:03,576 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-16 00:15:06,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-16 00:15:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:06,092 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-12-16 00:15:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 00:15:06,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 123 [2021-12-16 00:15:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:06,093 INFO L225 Difference]: With dead ends: 134 [2021-12-16 00:15:06,093 INFO L226 Difference]: Without dead ends: 132 [2021-12-16 00:15:06,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-16 00:15:06,093 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:06,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 152 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-12-16 00:15:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-16 00:15:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2021-12-16 00:15:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-16 00:15:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2021-12-16 00:15:06,101 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2021-12-16 00:15:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:06,101 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2021-12-16 00:15:06,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-16 00:15:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2021-12-16 00:15:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-16 00:15:06,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:06,102 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:06,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:06,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-16 00:15:06,303 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:06,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:06,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2021-12-16 00:15:06,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:06,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129005217] [2021-12-16 00:15:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:06,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:06,309 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:06,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202394958] [2021-12-16 00:15:06,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 00:15:06,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:06,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:06,310 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:06,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 00:15:06,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 00:15:06,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:06,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 00:15:06,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-12-16 00:15:06,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-12-16 00:15:06,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:06,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129005217] [2021-12-16 00:15:06,911 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:06,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202394958] [2021-12-16 00:15:06,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202394958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:15:06,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:15:06,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-16 00:15:06,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059287122] [2021-12-16 00:15:06,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:06,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 00:15:06,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 00:15:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-16 00:15:06,913 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2021-12-16 00:15:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:07,289 INFO L93 Difference]: Finished difference Result 390 states and 406 transitions. [2021-12-16 00:15:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 00:15:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2021-12-16 00:15:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:07,304 INFO L225 Difference]: With dead ends: 390 [2021-12-16 00:15:07,304 INFO L226 Difference]: Without dead ends: 365 [2021-12-16 00:15:07,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-16 00:15:07,312 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 144 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:07,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 266 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 00:15:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-16 00:15:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 313. [2021-12-16 00:15:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 203 states have internal predecessors, (205), 63 states have call successors, (63), 54 states have call predecessors, (63), 53 states have return successors, (61), 55 states have call predecessors, (61), 61 states have call successors, (61) [2021-12-16 00:15:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 329 transitions. [2021-12-16 00:15:07,359 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 329 transitions. Word has length 125 [2021-12-16 00:15:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:07,359 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 329 transitions. [2021-12-16 00:15:07,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2021-12-16 00:15:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 329 transitions. [2021-12-16 00:15:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-16 00:15:07,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:07,360 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:07,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:07,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:07,577 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 709017654, now seen corresponding path program 3 times [2021-12-16 00:15:07,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167370649] [2021-12-16 00:15:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:07,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:07,583 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:07,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492962279] [2021-12-16 00:15:07,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 00:15:07,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:07,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:07,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-16 00:15:08,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-16 00:15:08,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-16 00:15:08,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2021-12-16 00:15:08,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:08,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:08,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167370649] [2021-12-16 00:15:08,603 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:08,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492962279] [2021-12-16 00:15:08,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492962279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:15:08,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:15:08,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-12-16 00:15:08,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276689083] [2021-12-16 00:15:08,604 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:08,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 00:15:08,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 00:15:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-16 00:15:08,605 INFO L87 Difference]: Start difference. First operand 313 states and 329 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2021-12-16 00:15:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:08,742 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2021-12-16 00:15:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 00:15:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 128 [2021-12-16 00:15:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:08,744 INFO L225 Difference]: With dead ends: 323 [2021-12-16 00:15:08,744 INFO L226 Difference]: Without dead ends: 312 [2021-12-16 00:15:08,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-16 00:15:08,744 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:08,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 340 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:15:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-16 00:15:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-16 00:15:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 202 states have internal predecessors, (204), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2021-12-16 00:15:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 326 transitions. [2021-12-16 00:15:08,761 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 326 transitions. Word has length 128 [2021-12-16 00:15:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:08,761 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 326 transitions. [2021-12-16 00:15:08,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2021-12-16 00:15:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 326 transitions. [2021-12-16 00:15:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-16 00:15:08,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:08,763 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:08,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:08,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-16 00:15:08,968 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 4 times [2021-12-16 00:15:08,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877232966] [2021-12-16 00:15:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:08,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:08,988 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:08,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678983324] [2021-12-16 00:15:08,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 00:15:08,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:08,990 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:08,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-16 00:15:10,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 00:15:10,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:10,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-16 00:15:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 245 proven. 249 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2021-12-16 00:15:11,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:15,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877232966] [2021-12-16 00:15:15,277 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678983324] [2021-12-16 00:15:15,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678983324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:15:15,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 00:15:15,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-16 00:15:15,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42093360] [2021-12-16 00:15:15,277 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:15:15,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:15:15,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-16 00:15:15,278 INFO L87 Difference]: Start difference. First operand 312 states and 326 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-16 00:15:19,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-16 00:15:21,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-16 00:15:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:24,067 INFO L93 Difference]: Finished difference Result 319 states and 332 transitions. [2021-12-16 00:15:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 00:15:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 156 [2021-12-16 00:15:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:24,069 INFO L225 Difference]: With dead ends: 319 [2021-12-16 00:15:24,069 INFO L226 Difference]: Without dead ends: 293 [2021-12-16 00:15:24,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 178 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-12-16 00:15:24,070 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:24,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 139 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2021-12-16 00:15:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-16 00:15:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-12-16 00:15:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 188 states have (on average 1.0106382978723405) internal successors, (190), 189 states have internal predecessors, (190), 53 states have call successors, (53), 51 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-12-16 00:15:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 295 transitions. [2021-12-16 00:15:24,084 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 295 transitions. Word has length 156 [2021-12-16 00:15:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:24,084 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 295 transitions. [2021-12-16 00:15:24,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-16 00:15:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 295 transitions. [2021-12-16 00:15:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-12-16 00:15:24,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:24,087 INFO L514 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:24,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:24,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:24,294 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2021-12-16 00:15:24,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:24,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197405646] [2021-12-16 00:15:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:24,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:24,302 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219101328] [2021-12-16 00:15:24,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 00:15:24,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:24,321 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:24,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-16 00:15:24,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2021-12-16 00:15:24,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:15:24,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-16 00:15:24,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:15:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2021-12-16 00:15:24,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:15:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2021-12-16 00:15:25,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:15:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197405646] [2021-12-16 00:15:25,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:15:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219101328] [2021-12-16 00:15:25,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219101328] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:15:25,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:15:25,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-16 00:15:25,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687288808] [2021-12-16 00:15:25,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:15:25,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 00:15:25,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:15:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 00:15:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-12-16 00:15:25,402 INFO L87 Difference]: Start difference. First operand 293 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2021-12-16 00:15:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:15:25,849 INFO L93 Difference]: Finished difference Result 586 states and 598 transitions. [2021-12-16 00:15:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-16 00:15:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) Word has length 293 [2021-12-16 00:15:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:15:25,857 INFO L225 Difference]: With dead ends: 586 [2021-12-16 00:15:25,858 INFO L226 Difference]: Without dead ends: 573 [2021-12-16 00:15:25,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 561 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-12-16 00:15:25,859 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 159 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 00:15:25,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 516 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 00:15:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-12-16 00:15:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2021-12-16 00:15:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 368 states have (on average 1.0054347826086956) internal successors, (370), 369 states have internal predecessors, (370), 103 states have call successors, (103), 101 states have call predecessors, (103), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2021-12-16 00:15:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 575 transitions. [2021-12-16 00:15:25,909 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 575 transitions. Word has length 293 [2021-12-16 00:15:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:15:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 575 transitions. [2021-12-16 00:15:25,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2021-12-16 00:15:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 575 transitions. [2021-12-16 00:15:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2021-12-16 00:15:25,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:15:25,921 INFO L514 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:25,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:26,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:26,136 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:15:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:15:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1295956810, now seen corresponding path program 4 times [2021-12-16 00:15:26,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:15:26,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401451028] [2021-12-16 00:15:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:15:26,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:15:26,149 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:15:26,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109796316] [2021-12-16 00:15:26,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 00:15:26,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:15:26,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:15:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-16 00:15:26,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 00:15:26,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-16 00:15:26,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 00:15:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:15:26,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 00:15:26,816 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 00:15:26,816 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 00:15:26,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-16 00:15:27,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:15:27,027 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2021-12-16 00:15:27,029 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 00:15:27,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:15:27 BoogieIcfgContainer [2021-12-16 00:15:27,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 00:15:27,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 00:15:27,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 00:15:27,151 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 00:15:27,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:52" (3/4) ... [2021-12-16 00:15:27,152 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 00:15:27,238 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 00:15:27,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 00:15:27,239 INFO L158 Benchmark]: Toolchain (without parser) took 35216.87ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 69.3MB in the beginning and 129.7MB in the end (delta: -60.4MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,239 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:15:27,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.75ms. Allocated memory is still 100.7MB. Free memory was 69.0MB in the beginning and 76.4MB in the end (delta: -7.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.26ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 74.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:15:27,239 INFO L158 Benchmark]: Boogie Preprocessor took 14.56ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,240 INFO L158 Benchmark]: RCFGBuilder took 285.55ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 63.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,240 INFO L158 Benchmark]: TraceAbstraction took 34623.64ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 63.3MB in the beginning and 52.8MB in the end (delta: 10.5MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,240 INFO L158 Benchmark]: Witness Printer took 87.94ms. Allocated memory is still 176.2MB. Free memory was 52.8MB in the beginning and 129.7MB in the end (delta: -76.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 00:15:27,241 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.75ms. Allocated memory is still 100.7MB. Free memory was 69.0MB in the beginning and 76.4MB in the end (delta: -7.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.26ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 74.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.56ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.55ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 63.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34623.64ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 63.3MB in the beginning and 52.8MB in the end (delta: 10.5MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 87.94ms. Allocated memory is still 176.2MB. Free memory was 52.8MB in the beginning and 129.7MB in the end (delta: -76.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 562 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 3806 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2912 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2264 IncrementalHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 894 mSDtfsCounter, 2264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2207 SyntacticMatches, 24 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=20, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 78 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2133 ConstructedInterpolants, 0 QuantifiedInterpolants, 8743 SizeOfPredicates, 52 NumberOfNonLiveVariables, 3045 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 13141/19622 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-16 00:15:27,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE