./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/cohendiv-ll_valuebound10.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 e95b2c5c45a3ad7227c09caca59d62f5162f8293 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 05:12:36,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 05:12:36,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 05:12:36,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 05:12:36,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 05:12:36,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 05:12:36,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 05:12:36,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 05:12:36,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 05:12:36,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 05:12:36,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 05:12:36,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 05:12:36,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 05:12:36,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 05:12:36,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 05:12:36,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 05:12:36,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 05:12:36,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 05:12:36,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 05:12:36,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 05:12:36,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 05:12:36,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 05:12:36,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 05:12:36,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 05:12:36,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 05:12:36,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 05:12:36,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 05:12:36,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 05:12:36,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 05:12:36,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 05:12:36,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 05:12:36,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 05:12:36,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 05:12:36,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 05:12:36,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 05:12:36,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 05:12:36,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 05:12:36,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 05:12:36,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 05:12:36,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 05:12:36,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 05:12:36,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 05:12:36,633 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 05:12:36,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 05:12:36,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 05:12:36,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 05:12:36,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 05:12:36,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 05:12:36,635 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 05:12:36,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 05:12:36,635 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 05:12:36,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 05:12:36,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:12:36,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 05:12:36,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 05:12:36,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 05:12:36,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 05:12:36,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 05:12:36,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 05:12:36,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 05:12:36,649 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 -> e95b2c5c45a3ad7227c09caca59d62f5162f8293 [2021-08-26 05:12:36,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 05:12:36,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 05:12:36,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 05:12:36,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 05:12:36,879 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 05:12:36,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2021-08-26 05:12:36,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e776d0025/45b976082b204c3087ef0b988230b3e4/FLAG4b4586bee [2021-08-26 05:12:37,262 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 05:12:37,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2021-08-26 05:12:37,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e776d0025/45b976082b204c3087ef0b988230b3e4/FLAG4b4586bee [2021-08-26 05:12:37,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e776d0025/45b976082b204c3087ef0b988230b3e4 [2021-08-26 05:12:37,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 05:12:37,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 05:12:37,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 05:12:37,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 05:12:37,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 05:12:37,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154944a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37, skipping insertion in model container [2021-08-26 05:12:37,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 05:12:37,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 05:12:37,866 WARN L228 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/cohendiv-ll_valuebound10.c[576,589] [2021-08-26 05:12:37,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:12:37,883 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 05:12:37,919 WARN L228 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/cohendiv-ll_valuebound10.c[576,589] [2021-08-26 05:12:37,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:12:37,942 INFO L208 MainTranslator]: Completed translation [2021-08-26 05:12:37,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37 WrapperNode [2021-08-26 05:12:37,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 05:12:37,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 05:12:37,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 05:12:37,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 05:12:37,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 05:12:37,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 05:12:37,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 05:12:37,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 05:12:37,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:37,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:38,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:38,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:38,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 05:12:38,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 05:12:38,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 05:12:38,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 05:12:38,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (1/1) ... [2021-08-26 05:12:38,016 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:12:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:38,034 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-08-26 05:12:38,069 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-08-26 05:12:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 05:12:38,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 05:12:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 05:12:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 05:12:38,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 05:12:38,326 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-26 05:12:38,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:12:38 BoogieIcfgContainer [2021-08-26 05:12:38,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 05:12:38,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 05:12:38,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 05:12:38,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 05:12:38,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:12:37" (1/3) ... [2021-08-26 05:12:38,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b682cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:12:38, skipping insertion in model container [2021-08-26 05:12:38,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:37" (2/3) ... [2021-08-26 05:12:38,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b682cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:12:38, skipping insertion in model container [2021-08-26 05:12:38,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:12:38" (3/3) ... [2021-08-26 05:12:38,336 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound10.c [2021-08-26 05:12:38,339 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 05:12:38,339 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-08-26 05:12:38,370 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 05:12:38,374 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 05:12:38,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-26 05:12:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:12:38,387 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:38,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:38,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2021-08-26 05:12:38,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:38,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918327080] [2021-08-26 05:12:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:38,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:38,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:38,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918327080] [2021-08-26 05:12:38,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918327080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:38,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:38,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 05:12:38,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204431324] [2021-08-26 05:12:38,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 05:12:38,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 05:12:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:12:38,510 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:38,521 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-08-26 05:12:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 05:12:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 05:12:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:38,527 INFO L225 Difference]: With dead ends: 83 [2021-08-26 05:12:38,527 INFO L226 Difference]: Without dead ends: 39 [2021-08-26 05:12:38,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:12:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-26 05:12:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-26 05:12:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-08-26 05:12:38,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2021-08-26 05:12:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:38,549 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-08-26 05:12:38,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-08-26 05:12:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:12:38,550 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:38,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:38,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 05:12:38,550 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:38,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2021-08-26 05:12:38,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:38,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972232068] [2021-08-26 05:12:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:38,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:38,563 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:38,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141557195] [2021-08-26 05:12:38,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:38,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:38,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:38,565 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-08-26 05:12:38,604 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-08-26 05:12:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:38,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:12:38,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:38,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:38,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972232068] [2021-08-26 05:12:38,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:38,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141557195] [2021-08-26 05:12:38,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141557195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:38,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:38,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:12:38,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103640158] [2021-08-26 05:12:38,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:12:38,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:12:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:38,865 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:39,026 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-08-26 05:12:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 05:12:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:39,028 INFO L225 Difference]: With dead ends: 52 [2021-08-26 05:12:39,028 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 05:12:39,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 142.8ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:12:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 05:12:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-08-26 05:12:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-08-26 05:12:39,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2021-08-26 05:12:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:39,040 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-08-26 05:12:39,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-08-26 05:12:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 05:12:39,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:39,042 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:39,062 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-08-26 05:12:39,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:39,256 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2021-08-26 05:12:39,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:39,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245877011] [2021-08-26 05:12:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:39,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:39,271 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:39,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683212215] [2021-08-26 05:12:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:39,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:39,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:39,281 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-08-26 05:12:39,286 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-08-26 05:12:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:39,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:12:39,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:39,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:39,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245877011] [2021-08-26 05:12:39,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:39,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683212215] [2021-08-26 05:12:39,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683212215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:39,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:39,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:12:39,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322148159] [2021-08-26 05:12:39,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:12:39,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:12:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:39,549 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:39,707 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-26 05:12:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:39,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 05:12:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:39,708 INFO L225 Difference]: With dead ends: 69 [2021-08-26 05:12:39,709 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:12:39,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 124.1ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:12:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:12:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-08-26 05:12:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-08-26 05:12:39,713 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2021-08-26 05:12:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:39,713 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-08-26 05:12:39,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-08-26 05:12:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 05:12:39,714 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:39,714 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:39,732 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-08-26 05:12:39,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-26 05:12:39,923 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2021-08-26 05:12:39,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:39,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638536230] [2021-08-26 05:12:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:39,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:39,934 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:39,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039925167] [2021-08-26 05:12:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:39,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:39,935 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-08-26 05:12:39,951 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-08-26 05:12:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:40,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 05:12:40,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:40,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:40,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638536230] [2021-08-26 05:12:40,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:40,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039925167] [2021-08-26 05:12:40,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039925167] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:40,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:40,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 05:12:40,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176003900] [2021-08-26 05:12:40,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 05:12:40,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 05:12:40,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 05:12:40,052 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:40,113 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-08-26 05:12:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 05:12:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 05:12:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:40,115 INFO L225 Difference]: With dead ends: 95 [2021-08-26 05:12:40,115 INFO L226 Difference]: Without dead ends: 89 [2021-08-26 05:12:40,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:12:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-26 05:12:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2021-08-26 05:12:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-08-26 05:12:40,121 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 16 [2021-08-26 05:12:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:40,121 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-08-26 05:12:40,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-08-26 05:12:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 05:12:40,122 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:40,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:40,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 05:12:40,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:40,337 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2015957290, now seen corresponding path program 1 times [2021-08-26 05:12:40,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:40,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171632301] [2021-08-26 05:12:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:40,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:40,347 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:40,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264109365] [2021-08-26 05:12:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:40,348 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:40,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:40,349 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-08-26 05:12:40,375 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-08-26 05:12:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:40,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 05:12:40,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:40,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:40,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171632301] [2021-08-26 05:12:40,541 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:40,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264109365] [2021-08-26 05:12:40,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264109365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:40,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:40,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 05:12:40,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037072176] [2021-08-26 05:12:40,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:12:40,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:12:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:40,543 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:40,626 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2021-08-26 05:12:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 05:12:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:40,629 INFO L225 Difference]: With dead ends: 72 [2021-08-26 05:12:40,629 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 05:12:40,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:12:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 05:12:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-26 05:12:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.203125) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2021-08-26 05:12:40,641 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 20 [2021-08-26 05:12:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:40,642 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2021-08-26 05:12:40,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2021-08-26 05:12:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 05:12:40,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:40,643 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:40,661 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-08-26 05:12:40,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:40,857 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2021-08-26 05:12:40,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:40,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738228096] [2021-08-26 05:12:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:40,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:40,865 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:40,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804021361] [2021-08-26 05:12:40,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:40,865 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:40,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:40,866 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-08-26 05:12:40,877 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-08-26 05:12:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:40,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 05:12:40,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:41,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:41,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738228096] [2021-08-26 05:12:41,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:41,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804021361] [2021-08-26 05:12:41,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804021361] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:41,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:41,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:12:41,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919788749] [2021-08-26 05:12:41,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:12:41,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:12:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:41,124 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:41,293 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-08-26 05:12:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 05:12:41,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-26 05:12:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:41,295 INFO L225 Difference]: With dead ends: 123 [2021-08-26 05:12:41,295 INFO L226 Difference]: Without dead ends: 117 [2021-08-26 05:12:41,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:12:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-26 05:12:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2021-08-26 05:12:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-08-26 05:12:41,311 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 25 [2021-08-26 05:12:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:41,311 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-08-26 05:12:41,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-08-26 05:12:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 05:12:41,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:41,312 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:41,335 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-08-26 05:12:41,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:41,529 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2021-08-26 05:12:41,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:41,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139420727] [2021-08-26 05:12:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:41,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:41,539 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:41,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029895158] [2021-08-26 05:12:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:41,541 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:41,542 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-08-26 05:12:41,543 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-08-26 05:12:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:41,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 05:12:41,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:41,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:41,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139420727] [2021-08-26 05:12:41,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:41,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029895158] [2021-08-26 05:12:41,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029895158] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:41,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:41,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:12:41,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504356759] [2021-08-26 05:12:41,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:12:41,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:12:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:41,812 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:41,909 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2021-08-26 05:12:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 05:12:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:41,910 INFO L225 Difference]: With dead ends: 140 [2021-08-26 05:12:41,910 INFO L226 Difference]: Without dead ends: 132 [2021-08-26 05:12:41,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:12:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-26 05:12:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2021-08-26 05:12:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 100 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-08-26 05:12:41,923 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 26 [2021-08-26 05:12:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:41,924 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-08-26 05:12:41,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-08-26 05:12:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 05:12:41,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:41,927 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:41,946 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-08-26 05:12:42,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:42,141 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2021-08-26 05:12:42,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:42,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46324761] [2021-08-26 05:12:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:42,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:42,149 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:42,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161763099] [2021-08-26 05:12:42,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:12:42,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:42,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:42,152 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-08-26 05:12:42,182 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-08-26 05:12:42,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:12:42,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:42,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 05:12:42,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:42,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:42,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46324761] [2021-08-26 05:12:42,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:42,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161763099] [2021-08-26 05:12:42,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161763099] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:42,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:42,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-26 05:12:42,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284160924] [2021-08-26 05:12:42,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:12:42,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:12:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:42,517 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:42,803 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2021-08-26 05:12:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 05:12:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 05:12:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:42,806 INFO L225 Difference]: With dead ends: 168 [2021-08-26 05:12:42,806 INFO L226 Difference]: Without dead ends: 162 [2021-08-26 05:12:42,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 167.7ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-26 05:12:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-26 05:12:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2021-08-26 05:12:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 113 states have (on average 1.176991150442478) internal successors, (133), 118 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2021-08-26 05:12:42,816 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 34 [2021-08-26 05:12:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:42,817 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2021-08-26 05:12:42,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2021-08-26 05:12:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 05:12:42,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:42,821 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:42,840 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-08-26 05:12:43,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:43,037 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2021-08-26 05:12:43,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:43,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007300859] [2021-08-26 05:12:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:43,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:43,045 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:43,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222616652] [2021-08-26 05:12:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:43,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:43,051 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-08-26 05:12:43,089 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-08-26 05:12:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:43,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-26 05:12:43,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:43,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:43,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007300859] [2021-08-26 05:12:43,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:43,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222616652] [2021-08-26 05:12:43,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222616652] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:43,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:43,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-26 05:12:43,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013830037] [2021-08-26 05:12:43,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 05:12:43,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 05:12:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:12:43,537 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:43,772 INFO L93 Difference]: Finished difference Result 210 states and 234 transitions. [2021-08-26 05:12:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 05:12:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-26 05:12:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:43,773 INFO L225 Difference]: With dead ends: 210 [2021-08-26 05:12:43,773 INFO L226 Difference]: Without dead ends: 202 [2021-08-26 05:12:43,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 103.8ms TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:12:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-26 05:12:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 128. [2021-08-26 05:12:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 127 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-08-26 05:12:43,782 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 35 [2021-08-26 05:12:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:43,783 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-08-26 05:12:43,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-08-26 05:12:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 05:12:43,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:43,783 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:43,803 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-08-26 05:12:43,996 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,SelfDestructingSolverStorable8 [2021-08-26 05:12:43,997 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1158953764, now seen corresponding path program 2 times [2021-08-26 05:12:43,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:43,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083843803] [2021-08-26 05:12:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:43,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:44,005 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:44,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32646727] [2021-08-26 05:12:44,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:12:44,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:44,012 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-08-26 05:12:44,023 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-08-26 05:12:44,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:12:44,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:44,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 05:12:44,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:44,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:44,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083843803] [2021-08-26 05:12:44,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:44,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32646727] [2021-08-26 05:12:44,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32646727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:44,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:44,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 05:12:44,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55370589] [2021-08-26 05:12:44,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:12:44,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:44,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:12:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:12:44,272 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:44,312 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2021-08-26 05:12:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:12:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 05:12:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:44,315 INFO L225 Difference]: With dead ends: 241 [2021-08-26 05:12:44,315 INFO L226 Difference]: Without dead ends: 142 [2021-08-26 05:12:44,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-26 05:12:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2021-08-26 05:12:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 128 states have (on average 1.1640625) internal successors, (149), 133 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-08-26 05:12:44,322 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 39 [2021-08-26 05:12:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:44,322 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-08-26 05:12:44,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-08-26 05:12:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 05:12:44,324 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:44,324 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:44,343 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-08-26 05:12:44,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 05:12:44,541 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421613, now seen corresponding path program 3 times [2021-08-26 05:12:44,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:44,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401089107] [2021-08-26 05:12:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:44,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:44,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:44,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364510047] [2021-08-26 05:12:44,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:12:44,548 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:44,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:44,549 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-08-26 05:12:44,558 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-08-26 05:12:44,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 05:12:44,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:44,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 05:12:44,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 05:12:44,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:44,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401089107] [2021-08-26 05:12:44,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:44,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364510047] [2021-08-26 05:12:44,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364510047] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:44,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:44,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:12:44,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8549685] [2021-08-26 05:12:44,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:12:44,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:12:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:44,978 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:50,667 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2021-08-26 05:12:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:12:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-08-26 05:12:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:50,668 INFO L225 Difference]: With dead ends: 142 [2021-08-26 05:12:50,668 INFO L226 Difference]: Without dead ends: 136 [2021-08-26 05:12:50,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2928.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-26 05:12:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 87. [2021-08-26 05:12:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-08-26 05:12:50,682 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 43 [2021-08-26 05:12:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:50,682 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-08-26 05:12:50,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-08-26 05:12:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 05:12:50,683 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:50,683 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:50,701 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-08-26 05:12:50,896 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,SelfDestructingSolverStorable10 [2021-08-26 05:12:50,897 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2021-08-26 05:12:50,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:50,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298304603] [2021-08-26 05:12:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:50,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:50,909 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:50,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428587470] [2021-08-26 05:12:50,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:12:50,910 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:50,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:50,912 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-08-26 05:12:50,927 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-08-26 05:12:51,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:12:51,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:51,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-26 05:12:51,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:51,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:51,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298304603] [2021-08-26 05:12:51,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:51,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428587470] [2021-08-26 05:12:51,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428587470] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:51,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:51,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-08-26 05:12:51,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578621495] [2021-08-26 05:12:51,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 05:12:51,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 05:12:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:12:51,921 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:52,440 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2021-08-26 05:12:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 05:12:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-26 05:12:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:52,442 INFO L225 Difference]: With dead ends: 143 [2021-08-26 05:12:52,442 INFO L226 Difference]: Without dead ends: 135 [2021-08-26 05:12:52,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 397.0ms TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2021-08-26 05:12:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-26 05:12:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2021-08-26 05:12:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.118279569892473) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-08-26 05:12:52,451 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 44 [2021-08-26 05:12:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:52,452 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-08-26 05:12:52,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-08-26 05:12:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 05:12:52,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:52,452 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:52,472 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-08-26 05:12:52,668 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,SelfDestructingSolverStorable11 [2021-08-26 05:12:52,669 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2021-08-26 05:12:52,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:52,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302459755] [2021-08-26 05:12:52,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:52,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:52,676 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:52,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223835137] [2021-08-26 05:12:52,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:12:52,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:52,681 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-08-26 05:12:52,705 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-08-26 05:12:52,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:12:52,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:52,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 05:12:52,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-26 05:12:53,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:53,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302459755] [2021-08-26 05:12:53,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:53,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223835137] [2021-08-26 05:12:53,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223835137] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:53,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:53,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 05:12:53,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013962982] [2021-08-26 05:12:53,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:12:53,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:12:53,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:53,119 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:53,241 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2021-08-26 05:12:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:12:53,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-26 05:12:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:53,242 INFO L225 Difference]: With dead ends: 110 [2021-08-26 05:12:53,242 INFO L226 Difference]: Without dead ends: 96 [2021-08-26 05:12:53,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 65.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:12:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-26 05:12:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-08-26 05:12:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 75 states have (on average 1.08) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-08-26 05:12:53,249 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 48 [2021-08-26 05:12:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:53,249 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-08-26 05:12:53,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-08-26 05:12:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 05:12:53,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:53,250 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:53,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-26 05:12:53,467 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,SelfDestructingSolverStorable12 [2021-08-26 05:12:53,467 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1934789142, now seen corresponding path program 4 times [2021-08-26 05:12:53,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:53,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917891114] [2021-08-26 05:12:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:53,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:53,475 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:53,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596035009] [2021-08-26 05:12:53,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 05:12:53,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:53,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:53,477 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-08-26 05:12:53,483 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-08-26 05:12:53,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 05:12:53,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:53,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-26 05:12:53,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:55,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:55,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917891114] [2021-08-26 05:12:55,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:55,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596035009] [2021-08-26 05:12:55,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596035009] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:55,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:55,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:12:55,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894397284] [2021-08-26 05:12:55,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:12:55,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:12:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:12:55,241 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:56,211 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-08-26 05:12:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 05:12:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-26 05:12:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:56,212 INFO L225 Difference]: With dead ends: 133 [2021-08-26 05:12:56,212 INFO L226 Difference]: Without dead ends: 125 [2021-08-26 05:12:56,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 519.4ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-08-26 05:12:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-26 05:12:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2021-08-26 05:12:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-08-26 05:12:56,221 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2021-08-26 05:12:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:56,221 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-08-26 05:12:56,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-08-26 05:12:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 05:12:56,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:56,222 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:56,241 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-08-26 05:12:56,422 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,SelfDestructingSolverStorable13 [2021-08-26 05:12:56,422 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 5 times [2021-08-26 05:12:56,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:56,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165453503] [2021-08-26 05:12:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:56,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:56,433 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:56,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153364654] [2021-08-26 05:12:56,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 05:12:56,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:56,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:56,438 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-08-26 05:12:56,439 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-08-26 05:12:56,779 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-08-26 05:12:56,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 05:12:56,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:56,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:56,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165453503] [2021-08-26 05:12:56,942 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:56,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153364654] [2021-08-26 05:12:56,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153364654] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:56,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:56,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:12:56,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287030564] [2021-08-26 05:12:56,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:12:56,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:12:56,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:56,943 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:57,058 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2021-08-26 05:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-26 05:12:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:57,059 INFO L225 Difference]: With dead ends: 159 [2021-08-26 05:12:57,059 INFO L226 Difference]: Without dead ends: 116 [2021-08-26 05:12:57,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:12:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-26 05:12:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2021-08-26 05:12:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.087378640776699) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2021-08-26 05:12:57,075 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 57 [2021-08-26 05:12:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:57,075 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2021-08-26 05:12:57,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2021-08-26 05:12:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 05:12:57,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:57,076 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:57,096 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-08-26 05:12:57,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:57,291 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1860833829, now seen corresponding path program 6 times [2021-08-26 05:12:57,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:57,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081754403] [2021-08-26 05:12:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:57,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:57,299 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:57,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199283710] [2021-08-26 05:12:57,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 05:12:57,300 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:57,301 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-08-26 05:12:57,302 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-08-26 05:12:57,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-26 05:12:57,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:57,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 05:12:57,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-08-26 05:12:57,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:57,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081754403] [2021-08-26 05:12:57,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:57,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199283710] [2021-08-26 05:12:57,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199283710] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:57,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:57,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:12:57,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429930238] [2021-08-26 05:12:57,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:12:57,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:12:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:57,930 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:58,088 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-08-26 05:12:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 05:12:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-26 05:12:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:58,089 INFO L225 Difference]: With dead ends: 125 [2021-08-26 05:12:58,089 INFO L226 Difference]: Without dead ends: 110 [2021-08-26 05:12:58,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 103.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:12:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-26 05:12:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2021-08-26 05:12:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-08-26 05:12:58,099 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 62 [2021-08-26 05:12:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:58,099 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-08-26 05:12:58,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:12:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-08-26 05:12:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 05:12:58,099 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:58,099 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:58,118 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-08-26 05:12:58,313 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,SelfDestructingSolverStorable15 [2021-08-26 05:12:58,314 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:12:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 7 times [2021-08-26 05:12:58,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:58,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464711770] [2021-08-26 05:12:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:58,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:58,320 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:58,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526196751] [2021-08-26 05:12:58,320 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 05:12:58,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:58,321 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-08-26 05:12:58,327 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-08-26 05:12:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:58,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-26 05:12:58,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:12:59,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:59,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464711770] [2021-08-26 05:12:59,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:59,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526196751] [2021-08-26 05:12:59,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526196751] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:59,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:59,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-08-26 05:12:59,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953759782] [2021-08-26 05:12:59,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 05:12:59,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:59,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 05:12:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-08-26 05:12:59,852 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:00,279 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2021-08-26 05:13:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-26 05:13:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-26 05:13:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:00,281 INFO L225 Difference]: With dead ends: 158 [2021-08-26 05:13:00,281 INFO L226 Difference]: Without dead ends: 93 [2021-08-26 05:13:00,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 274.3ms TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2021-08-26 05:13:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-26 05:13:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2021-08-26 05:13:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-08-26 05:13:00,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 66 [2021-08-26 05:13:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:00,291 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-08-26 05:13:00,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-08-26 05:13:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 05:13:00,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:00,292 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:13:00,316 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-08-26 05:13:00,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-26 05:13:00,515 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-08-26 05:13:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 822588344, now seen corresponding path program 8 times [2021-08-26 05:13:00,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:00,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388578721] [2021-08-26 05:13:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:00,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:00,523 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:00,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972127793] [2021-08-26 05:13:00,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:00,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:00,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:00,536 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-08-26 05:13:00,568 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-08-26 05:13:01,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:01,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:01,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-26 05:13:01,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:02,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:02,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388578721] [2021-08-26 05:13:02,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:02,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972127793] [2021-08-26 05:13:02,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972127793] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:02,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:02,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-08-26 05:13:02,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840440435] [2021-08-26 05:13:02,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-26 05:13:02,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-26 05:13:02,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-08-26 05:13:02,618 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:03,416 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2021-08-26 05:13:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-26 05:13:03,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-26 05:13:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:03,417 INFO L225 Difference]: With dead ends: 126 [2021-08-26 05:13:03,417 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 05:13:03,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 767.4ms TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2021-08-26 05:13:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 05:13:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 05:13:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 05:13:03,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-08-26 05:13:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:03,419 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 05:13:03,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:13:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 05:13:03,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 05:13:03,421 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,421 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,421 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,421 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,422 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,422 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,422 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:03,440 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-08-26 05:13:03,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 05:13:03,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 05:13:03,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:03,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:03,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:03,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:03,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:04,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:04,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:04,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:04,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:04,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L853 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse23 (* 2 ULTIMATE.start_main_~y~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse7 (<= ULTIMATE.start_main_~y~0 10)) (.cse18 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (let ((.cse21 (* 4 ULTIMATE.start_main_~y~0)) (.cse9 (<= 1 ULTIMATE.start_main_~y~0)) (.cse22 (let ((.cse24 (<= 0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse2 .cse24 (= ULTIMATE.start_main_~b~0 .cse23) (= ULTIMATE.start_main_~a~0 2) .cse7) (and .cse0 .cse2 .cse24 (= ULTIMATE.start_main_~a~0 1) .cse7 .cse18))))) (let ((.cse17 (or (and .cse0 .cse2 (= ULTIMATE.start_main_~b~0 .cse21) (= ULTIMATE.start_main_~a~0 4) .cse9 .cse7) (and .cse9 .cse22))) (.cse20 (* 8 ULTIMATE.start_main_~y~0))) (let ((.cse4 (< ULTIMATE.start_main_~x~0 .cse20)) (.cse13 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (.cse11 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse16 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0))) (.cse10 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0)) (.cse12 (<= 0 ULTIMATE.start_main_~x~0)) (.cse15 (= (+ ULTIMATE.start_main_~r~0 .cse21) ULTIMATE.start_main_~x~0)) (.cse6 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse14 (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse9 .cse22 (= ULTIMATE.start_main_~q~0 1) .cse18) (and .cse17 (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse23)) (<= .cse23 ULTIMATE.start_main_~x~0)))) (.cse3 (<= ULTIMATE.start_main_~x~0 10)) (.cse8 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse5 (<= (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0))) (or (let ((.cse1 (* 6 ULTIMATE.start_main_~y~0))) (and .cse0 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse1)) .cse2 (<= .cse1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 6) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse0 .cse2 (<= 0 ULTIMATE.start_main_~r~0) .cse9 .cse3 .cse5 .cse6 (= ULTIMATE.start_main_~q~0 10) .cse7 .cse8 (exists ((aux_div_ULTIMATE.start_main_~b~0_36 Int)) (and (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* aux_div_ULTIMATE.start_main_~b~0_36 2) (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2)) (<= (+ ULTIMATE.start_main_~y~0 aux_div_ULTIMATE.start_main_~b~0_36) 0)))) (and .cse0 .cse9 .cse10 .cse11 .cse3 .cse6 .cse7 .cse12 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (and .cse13 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse14) (and .cse0 .cse2 .cse15 .cse16 .cse9 .cse10 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8) (and .cse17 .cse13 .cse11 .cse3 .cse12 .cse18) (and .cse0 .cse2 (= ULTIMATE.start_main_~q~0 8) .cse16 .cse9 .cse10 .cse3 .cse6 .cse7 .cse12 .cse8) (and (< (div (+ (- 1) (* ULTIMATE.start_main_~r~0 (- 1))) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) (or (let ((.cse19 (div ULTIMATE.start_main_~q~0 2))) (and .cse0 (= (mod (div (- .cse19) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse19 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse2 (= (mod ULTIMATE.start_main_~q~0 2) 0) .cse3 (= (mod .cse19 (- 2)) 0) .cse6 .cse7 .cse8 (<= .cse20 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse20) ULTIMATE.start_main_~x~0))) (and (= ULTIMATE.start_main_~q~0 4) .cse0 (<= .cse21 ULTIMATE.start_main_~x~0) .cse2 .cse15 .cse3 .cse6 .cse7 .cse8) (and .cse14 .cse3 .cse8)) .cse5)))))) [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2021-08-26 05:13:18,758 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L853 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse18 (* 8 ULTIMATE.start_main_~y~0)) (.cse23 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))) (.cse20 (* 2 ULTIMATE.start_main_~y~0))) (let ((.cse4 (= ULTIMATE.start_main_~a~0 2)) (.cse22 (<= .cse20 ULTIMATE.start_main_~r~0)) (.cse8 (= ULTIMATE.start_main_~b~0 (* 2 .cse23))) (.cse11 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse13 (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0))) (.cse10 (<= 0 ULTIMATE.start_main_~x~0)) (.cse12 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2))) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse19 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse16 (= ULTIMATE.start_main_~a~0 1)) (.cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse7 (<= ULTIMATE.start_main_~x~0 10)) (.cse21 (< ULTIMATE.start_main_~x~0 .cse18)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse17 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 (<= (* 2 (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2))) ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 4) .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse13 (let ((.cse15 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (let ((.cse14 (div ULTIMATE.start_main_~q~0 2))) (and .cse0 (= (mod (div (- .cse14) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse14 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse15 .cse16 (= (mod ULTIMATE.start_main_~q~0 2) 0) .cse7 (= (mod .cse14 (- 2)) 0) .cse17 (<= .cse18 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse18) ULTIMATE.start_main_~x~0))) (and (or (and (= ULTIMATE.start_main_~q~0 4) .cse0 .cse15 .cse19 .cse2 .cse7) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse15 .cse2 (= ULTIMATE.start_main_~q~0 1)) (and .cse0 .cse15 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse20)) (<= .cse20 ULTIMATE.start_main_~x~0))) .cse7)) .cse16 .cse17)))) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse6 .cse7 .cse22 (= ULTIMATE.start_main_~y~0 .cse23) .cse8 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 (= ULTIMATE.start_main_~a~0 8)) (and .cse0 .cse13 .cse1 .cse2 .cse16 .cse6 .cse7 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse3 .cse16 .cse6 .cse7 .cse9 .cse10 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse9 .cse17) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse21 .cse9 .cse17)))) [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L853 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse18 (* 8 ULTIMATE.start_main_~y~0)) (.cse19 (* 4 ULTIMATE.start_main_~y~0)) (.cse9 (= ULTIMATE.start_main_~a~0 1)) (.cse12 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse6 (<= ULTIMATE.start_main_~y~0 10))) (let ((.cse8 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (.cse16 (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse9 (= ULTIMATE.start_main_~q~0 1) .cse6 .cse12) (let ((.cse21 (* 2 ULTIMATE.start_main_~y~0))) (and (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse0 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse21)) .cse2 (<= .cse21 ULTIMATE.start_main_~x~0) .cse6)))) (.cse4 (<= (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) (.cse20 (= (+ ULTIMATE.start_main_~r~0 .cse19) ULTIMATE.start_main_~x~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse13 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0)) (.cse10 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse3 (<= ULTIMATE.start_main_~x~0 10)) (.cse15 (< ULTIMATE.start_main_~x~0 .cse18)) (.cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse11 (<= 0 ULTIMATE.start_main_~x~0)) (.cse7 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0))) (or (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~q~0 10) .cse6 .cse7 (exists ((aux_div_ULTIMATE.start_main_~b~0_36 Int)) (and (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* aux_div_ULTIMATE.start_main_~b~0_36 2) (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2)) (<= (+ ULTIMATE.start_main_~y~0 aux_div_ULTIMATE.start_main_~b~0_36) 0)))) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 (= ULTIMATE.start_main_~q~0 8) .cse2 .cse13 .cse10 .cse3 .cse5 .cse6 .cse11 .cse7) (let ((.cse14 (* 6 ULTIMATE.start_main_~y~0))) (and .cse0 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse14)) (<= .cse14 ULTIMATE.start_main_~x~0) .cse1 (= ULTIMATE.start_main_~q~0 6) .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7)) (and .cse8 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse16) (and .cse0 .cse1 .cse2 .cse13 .cse10 .cse3 .cse5 .cse6 .cse11 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (and (< (div (+ (- 1) (* ULTIMATE.start_main_~r~0 (- 1))) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) (or (let ((.cse17 (div ULTIMATE.start_main_~q~0 2))) (and .cse0 (= (mod (div (- .cse17) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse17 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse1 .cse2 (= (mod ULTIMATE.start_main_~q~0 2) 0) .cse3 (= (mod .cse17 (- 2)) 0) .cse5 .cse6 .cse7 (<= .cse18 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse18) ULTIMATE.start_main_~x~0))) (and (= ULTIMATE.start_main_~q~0 4) .cse0 (<= .cse19 ULTIMATE.start_main_~x~0) .cse20 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse5 .cse7 .cse16)) .cse4) (and .cse0 .cse20 .cse1 .cse2 .cse13 .cse10 .cse3 .cse15 .cse5 .cse6 .cse11 .cse7)))) [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L853 garLoopResultBuilder]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse15 (* 4 ULTIMATE.start_main_~y~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse16 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse10 (= ULTIMATE.start_main_~a~0 1)) (.cse6 (<= ULTIMATE.start_main_~y~0 10)) (.cse11 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (let ((.cse9 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (.cse12 (or (let ((.cse20 (* 2 ULTIMATE.start_main_~y~0))) (and (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse0 .cse16 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse20)) (<= .cse20 ULTIMATE.start_main_~x~0) .cse6)) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse16 .cse2 .cse10 (= ULTIMATE.start_main_~q~0 1) .cse6 .cse11))) (.cse13 (< (div (+ (- 1) (* ULTIMATE.start_main_~r~0 (- 1))) (- 2)) (+ ULTIMATE.start_main_~y~0 1))) (.cse14 (<= (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) (.cse17 (= (+ ULTIMATE.start_main_~r~0 .cse15) ULTIMATE.start_main_~x~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse4 (<= ULTIMATE.start_main_~x~0 10)) (.cse19 (* 8 ULTIMATE.start_main_~y~0)) (.cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse7 (<= 0 ULTIMATE.start_main_~x~0)) (.cse8 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~q~0 8) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse6 .cse7 .cse11) (and .cse9 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse12) (and .cse13 .cse14 (or (and (= ULTIMATE.start_main_~q~0 4) .cse0 (<= .cse15 ULTIMATE.start_main_~x~0) .cse16 .cse17 .cse4 .cse5 .cse8) (and .cse4 .cse5 .cse12 .cse8) (let ((.cse18 (div ULTIMATE.start_main_~q~0 2))) (and .cse0 (= (mod (div (- .cse18) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse18 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse16 (= (mod ULTIMATE.start_main_~q~0 2) 0) .cse4 (= (mod .cse18 (- 2)) 0) .cse5 .cse8 (<= .cse19 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse19) ULTIMATE.start_main_~x~0))))) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 (< ULTIMATE.start_main_~x~0 .cse19) .cse5 .cse6 .cse7 .cse8)))) [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,759 INFO L853 garLoopResultBuilder]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse19 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (let ((.cse13 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~a~0 2)) (.cse15 (< ULTIMATE.start_main_~x~0 (* 8 ULTIMATE.start_main_~y~0))) (.cse17 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0)) (.cse8 (= ULTIMATE.start_main_~b~0 (* 2 .cse19))) (.cse11 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse18 (= ULTIMATE.start_main_~a~0 1)) (.cse10 (<= 0 ULTIMATE.start_main_~x~0)) (.cse12 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse14 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) (.cse5 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2))) (.cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse7 (<= ULTIMATE.start_main_~x~0 10)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse16 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 (<= (* 2 (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2))) ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 4) .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse9 .cse16) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse15 .cse17 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 (= ULTIMATE.start_main_~a~0 8)) (and .cse0 (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) .cse1 .cse2 .cse18 .cse6 .cse7 .cse9 .cse10 .cse16) (and .cse0 .cse1 .cse3 (= ULTIMATE.start_main_~q~0 0) .cse7 .cse17 (= ULTIMATE.start_main_~y~0 .cse19) .cse8 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse18 .cse6 .cse7 .cse9 .cse10 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse9 .cse16)))) [2021-08-26 05:13:18,759 INFO L857 garLoopResultBuilder]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L853 garLoopResultBuilder]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse19 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (let ((.cse1 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0)) (.cse8 (< ULTIMATE.start_main_~x~0 (* 8 ULTIMATE.start_main_~y~0))) (.cse12 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= 0 ULTIMATE.start_main_~r~0)) (.cse16 (= ULTIMATE.start_main_~a~0 2)) (.cse18 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2))) (.cse17 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0)) (.cse13 (= ULTIMATE.start_main_~b~0 (* 2 .cse19))) (.cse15 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (= ULTIMATE.start_main_~a~0 1)) (.cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse7 (<= ULTIMATE.start_main_~x~0 10)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse10 (<= 0 ULTIMATE.start_main_~x~0)) (.cse14 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse11 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 .cse13 .cse9 .cse10 .cse14 .cse15 (= ULTIMATE.start_main_~a~0 8)) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse17 .cse13 .cse9 .cse10 .cse15) (and .cse0 .cse12 .cse2 (= ULTIMATE.start_main_~a~0 4) .cse3 .cse4 .cse6 .cse7 .cse13 .cse9 .cse10 .cse14 .cse15) (and .cse0 (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 (<= (* 2 (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2))) ULTIMATE.start_main_~r~0) .cse3 .cse4 .cse16 .cse18 .cse6 .cse7 .cse13 .cse9 .cse10 .cse15) (and .cse0 .cse2 .cse4 (= ULTIMATE.start_main_~q~0 0) .cse7 .cse17 (= ULTIMATE.start_main_~y~0 .cse19) .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11)))) [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L853 garLoopResultBuilder]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse18 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (let ((.cse12 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse13 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~a~0 2)) (.cse15 (< ULTIMATE.start_main_~x~0 (* 8 ULTIMATE.start_main_~y~0))) (.cse17 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0)) (.cse8 (= ULTIMATE.start_main_~b~0 (* 2 .cse18))) (.cse11 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 0 ULTIMATE.start_main_~r~0)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse14 (= ULTIMATE.start_main_~a~0 1)) (.cse5 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2))) (.cse6 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse7 (<= ULTIMATE.start_main_~x~0 10)) (.cse9 (<= ULTIMATE.start_main_~y~0 10)) (.cse10 (<= 0 ULTIMATE.start_main_~x~0)) (.cse16 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 (<= (* 2 (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2))) ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 4) .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse6 .cse7 .cse15 .cse9 .cse10 .cse16) (and .cse0 .cse1 .cse3 .cse6 .cse7 .cse17 (= ULTIMATE.start_main_~y~0 .cse18) .cse8 .cse12 .cse11) (and .cse0 .cse1 (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) .cse2 .cse3 .cse14 .cse6 .cse7 .cse9 .cse10 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 (= ULTIMATE.start_main_~a~0 8)) (and .cse0 .cse1 .cse3 .cse14 .cse6 .cse7 .cse9 .cse10 .cse12 .cse16) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6 .cse7 .cse15 .cse17 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16)))) [2021-08-26 05:13:18,760 INFO L860 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L853 garLoopResultBuilder]: At program point L15-17(lines 14 20) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse8 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (= ULTIMATE.start_main_~a~0 1)) (.cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (let ((.cse1 (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~r~0)) (.cse0 (let ((.cse11 (<= 0 ULTIMATE.start_main_~r~0)) (.cse12 (<= ULTIMATE.start_main_~y~0 10))) (or (and .cse7 .cse8 .cse11 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse12 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse7 .cse8 .cse11 .cse9 .cse12 .cse6)))) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse4 (<= ULTIMATE.start_main_~x~0 10)) (.cse5 (<= 0 ULTIMATE.start_main_~x~0)) (.cse10 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 (= (+ ULTIMATE.start_main_~r~0 (* 4 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0) .cse2 .cse3 .cse4 (< ULTIMATE.start_main_~x~0 (* 8 ULTIMATE.start_main_~y~0)) .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 (= ULTIMATE.start_main_~q~0 0) .cse9 .cse4 .cse10 .cse6) (and .cse0 (= ULTIMATE.start_main_~a~0 4) .cse2 .cse3 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse9 (<= ULTIMATE.start_main_~y~0 (div (div (div (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~r~0 (- 1))) 2) 2) 2)) .cse3 .cse4 .cse5) (and .cse0 .cse2 (= ULTIMATE.start_main_~a~0 2) .cse3 .cse4 .cse5 .cse10)))) [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L860 garLoopResultBuilder]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,760 INFO L857 garLoopResultBuilder]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,761 INFO L857 garLoopResultBuilder]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:13:18,761 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 05:13:18,761 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:13:18,763 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 05:13:18,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 05:13:18 BoogieIcfgContainer [2021-08-26 05:13:18,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 05:13:18,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 05:13:18,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 05:13:18,812 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 05:13:18,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:12:38" (3/4) ... [2021-08-26 05:13:18,815 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 05:13:18,824 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-08-26 05:13:18,824 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 05:13:18,824 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:13:18,824 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:13:18,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((cond == 1 && x == r + 6 * y) && 1 <= cond) && 6 * y <= x) && q == 6) && x <= 10) && x < 8 * y) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || ((((((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && x <= 10) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && q == 10) && y <= 10) && a % -2 == 0) && (\exists aux_div_ULTIMATE.start_main_~b~0_36 : int :: y <= (x + aux_div_ULTIMATE.start_main_~b~0_36 * 2 + r * -1) / 2 / 2 / 2 && y + aux_div_ULTIMATE.start_main_~b~0_36 <= 0))) || ((((((((cond == 1 && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x)) || ((r < y && b <= y) && (((((x == r + y && 1 <= y) && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y))) && q == 1) && b == y) || ((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && 2 * r < x) && q == 2) && x == r + 2 * y) && 2 * y <= x)))) || (((((((((((cond == 1 && 1 <= cond) && r + 4 * y == x) && x == b + r) && 1 <= y) && a == q) && x <= 10) && x < 8 * y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && r < y) && x == r + q * y) && x <= 10) && 0 <= x) && b == y)) || ((((((((((cond == 1 && 1 <= cond) && q == 8) && x == b + r) && 1 <= y) && a == q) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((-1 + r * -1) / -2 < y + 1 && (((((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x) || ((((((((q == 4 && cond == 1) && 4 * y <= x) && 1 <= cond) && r + 4 * y == x) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || (((((((x == r + y && 1 <= y) && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y))) && q == 1) && b == y) || ((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && 2 * r < x) && q == 2) && x == r + 2 * y) && 2 * y <= x)) && x <= 10) && a % -2 == 0))) && b * -1 / -2 <= y) [2021-08-26 05:13:18,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && x <= 10) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && q == 10) && y <= 10) && a % -2 == 0) && (\exists aux_div_ULTIMATE.start_main_~b~0_36 : int :: y <= (x + aux_div_ULTIMATE.start_main_~b~0_36 * 2 + r * -1) / 2 / 2 / 2 && y + aux_div_ULTIMATE.start_main_~b~0_36 <= 0)) || (((((((((cond == 1 && r < y) && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || ((((((((((cond == 1 && 1 == cond) && q == 8) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((((cond == 1 && x == r + 6 * y) && 6 * y <= x) && 1 == cond) && q == 6) && 1 <= y) && x <= 10) && x < 8 * y) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || ((r < y && b <= y) && ((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y) || ((((((2 * r < x && cond == 1) && q == 2) && x == r + 2 * y) && 1 <= y) && 2 * y <= x) && y <= 10)))) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x)) || (((-1 + r * -1) / -2 < y + 1 && ((((((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 == cond) && 1 <= y) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x) || (((((((((q == 4 && cond == 1) && 4 * y <= x) && r + 4 * y == x) && 1 == cond) && 1 <= y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || ((((1 == cond && x <= 10) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) && ((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y) || ((((((2 * r < x && cond == 1) && q == 2) && x == r + 2 * y) && 1 <= y) && 2 * y <= x) && y <= 10))))) && b * -1 / -2 <= y)) || (((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && x < 8 * y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) [2021-08-26 05:13:18,858 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 05:13:18,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 05:13:18,859 INFO L168 Benchmark]: Toolchain (without parser) took 41126.30 ms. Allocated memory was 75.5 MB in the beginning and 262.1 MB in the end (delta: 186.6 MB). Free memory was 60.6 MB in the beginning and 191.0 MB in the end (delta: -130.4 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,860 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 75.5 MB. Free memory was 58.3 MB in the beginning and 58.3 MB in the end (delta: 58.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 05:13:18,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.59 ms. Allocated memory is still 75.5 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 989.3 kB). Peak memory consumption was 10.8 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.87 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,860 INFO L168 Benchmark]: Boogie Preprocessor took 36.32 ms. Allocated memory is still 75.5 MB. Free memory was 57.6 MB in the beginning and 56.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,861 INFO L168 Benchmark]: RCFGBuilder took 317.36 ms. Allocated memory is still 75.5 MB. Free memory was 56.5 MB in the beginning and 39.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,861 INFO L168 Benchmark]: TraceAbstraction took 40478.78 ms. Allocated memory was 75.5 MB in the beginning and 262.1 MB in the end (delta: 186.6 MB). Free memory was 39.0 MB in the beginning and 196.3 MB in the end (delta: -157.3 MB). Peak memory consumption was 171.0 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,861 INFO L168 Benchmark]: Witness Printer took 46.69 ms. Allocated memory is still 262.1 MB. Free memory was 196.3 MB in the beginning and 191.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 05:13:18,862 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.15 ms. Allocated memory is still 75.5 MB. Free memory was 58.3 MB in the beginning and 58.3 MB in the end (delta: 58.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 208.59 ms. Allocated memory is still 75.5 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 989.3 kB). Peak memory consumption was 10.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.87 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.32 ms. Allocated memory is still 75.5 MB. Free memory was 57.6 MB in the beginning and 56.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 317.36 ms. Allocated memory is still 75.5 MB. Free memory was 56.5 MB in the beginning and 39.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40478.78 ms. Allocated memory was 75.5 MB in the beginning and 262.1 MB in the end (delta: 186.6 MB). Free memory was 39.0 MB in the beginning and 196.3 MB in the end (delta: -157.3 MB). Peak memory consumption was 171.0 MB. Max. memory is 16.1 GB. * Witness Printer took 46.69 ms. Allocated memory is still 262.1 MB. Free memory was 196.3 MB in the beginning and 191.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 40394.7ms, OverallIterations: 18, TraceHistogramMax: 6, EmptinessCheckTime: 19.6ms, AutomataDifference: 10169.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 15131.5ms, InitialAbstractionConstructionTime: 7.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 507 SDtfs, 1538 SDslu, 1264 SDs, 0 SdLazy, 2982 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4731.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 5826.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=10, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 161.3ms AutomataMinimizationTime, 18 MinimizatonAttempts, 405 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 78 NumberOfFragments, 4255 HoareAnnotationTreeSize, 10 FomulaSimplifications, 869621 FormulaSimplificationTreeSizeReduction, 631.0ms HoareSimplificationTime, 10 FomulaSimplificationsInter, 205960 FormulaSimplificationTreeSizeReductionInter, 14491.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 98.2ms SsaConstructionTime, 318.9ms SatisfiabilityAnalysisTime, 7536.7ms InterpolantComputationTime, 678 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 660 ConstructedInterpolants, 3 QuantifiedInterpolants, 8081 SizeOfPredicates, 128 NumberOfNonLiveVariables, 2211 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 207/563 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && x < 8 * y) && y <= 10) && 0 <= x) && b == y) || ((((((((((((cond == 1 && 1 <= cond) && 1 == cond) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0) && a == 8)) || ((((((((((((((cond == 1 && 1 <= cond) && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && a == 2) && x == r + q * y) && x <= 10) && x < 8 * y) && 2 * y <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || ((((((((((((cond == 1 && 1 <= cond) && 1 == cond) && a == 4) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0)) || ((((((((((cond == 1 && r < 2 * b) && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || ((((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || (((((((((((((cond == 1 && 1 <= cond) && 1 == cond) && 2 * (b * -1 / -2) <= r) && 0 <= r) && 1 <= y) && a == 2) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && q == 0) && x <= 10) && 2 * y <= r) && y == y * (a * -1 / -2)) && b == 2 * (y * (a * -1 / -2))) && r == x) && a % -2 == 0)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && r == x) && b == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((((((((cond == 1 && 1 == cond) && 0 <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || (((((cond == 1 && 1 == cond) && 0 <= r) && a == 1) && y <= 10) && b == y)) && 2 * b <= r) && r + 4 * y == x) && 1 <= y) && x == r + q * y) && x <= 10) && x < 8 * y) && 0 <= x) && b == y) || ((((((((cond == 1 && 2 * b <= r) && 1 == cond) && 1 <= y) && q == 0) && a == 1) && x <= 10) && r == x) && b == y)) || ((((((((((((cond == 1 && 1 == cond) && 0 <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || (((((cond == 1 && 1 == cond) && 0 <= r) && a == 1) && y <= 10) && b == y)) && a == 4) && 1 <= y) && x == r + q * y) && x <= 10) && 0 <= x) && r == x)) || (((((((((((((cond == 1 && 1 == cond) && 0 <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || (((((cond == 1 && 1 == cond) && 0 <= r) && a == 1) && y <= 10) && b == y)) && 2 * b <= r) && 1 <= y) && a == 1) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && 0 <= x)) || ((((((((((((cond == 1 && 1 == cond) && 0 <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || (((((cond == 1 && 1 == cond) && 0 <= r) && a == 1) && y <= 10) && b == y)) && 1 <= y) && a == 2) && x == r + q * y) && x <= 10) && 0 <= x) && r == x) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((((((cond == 1 && 1 <= cond) && 2 * (b * -1 / -2) <= r) && 0 <= r) && 1 <= y) && a == 2) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) || (((((((((((cond == 1 && 1 <= cond) && a == 4) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0)) || (((((((((((cond == 1 && 1 <= cond) && r + 4 * y == x) && 0 <= r) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && x < 8 * y) && y <= 10) && 0 <= x) && b == y)) || (((((((((cond == 1 && 1 <= cond) && 1 <= y) && x == r + q * y) && x <= 10) && 2 * y <= r) && y == y * (a * -1 / -2)) && b == 2 * (y * (a * -1 / -2))) && r == x) && a % -2 == 0)) || ((((((((((cond == 1 && 1 <= cond) && r < 2 * b) && 0 <= r) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || (((((((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0) && a == 8)) || (((((((((cond == 1 && 1 <= cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && r == x) && b == y)) || (((((((((((((cond == 1 && 1 <= cond) && r + 4 * y == x) && 0 <= r) && 1 <= y) && a == 2) && x == r + q * y) && x <= 10) && x < 8 * y) && 2 * y <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || ((((((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && a == 1) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((((((((((cond == 1 && 1 == cond) && 2 * (b * -1 / -2) <= r) && 0 <= r) && 1 <= y) && a == 2) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) || (((((((((((cond == 1 && 1 == cond) && a == 4) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0)) || ((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && b == a * y) && x == r + q * y) && x <= 10) && x < 8 * y) && y <= 10) && b == y)) || (((((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && a == 2) && x == r + q * y) && x <= 10) && x < 8 * y) && 2 * y <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0) && a == 8)) || (((((((((cond == 1 && r < 2 * b) && 1 == cond) && 0 <= r) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && q == 0) && x <= 10) && 2 * y <= r) && y == y * (a * -1 / -2)) && b == 2 * (y * (a * -1 / -2))) && r == x) && a % -2 == 0)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && r == x) && b == y)) || (((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && b == a * y) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && y <= 10) && b == y) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((cond == 1 && 1 == cond) && q == 8) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) || (((((((((cond == 1 && r < y) && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || ((r < y && b <= y) && (((((((2 * r < x && cond == 1) && 1 <= cond) && q == 2) && x == r + 2 * y) && 2 * y <= x) && y <= 10) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y)))) || (((-1 + r * -1) / -2 < y + 1 && b * -1 / -2 <= y) && (((((((((q == 4 && cond == 1) && 4 * y <= x) && 1 <= cond) && r + 4 * y == x) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || (((x <= 10 && b == 2 * (y * (a * -1 / -2))) && (((((((2 * r < x && cond == 1) && 1 <= cond) && q == 2) && x == r + 2 * y) && 2 * y <= x) && y <= 10) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y))) && a % -2 == 0)) || ((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x)))) || ((((((((((cond == 1 && (-1 + r * -1) / -2 < y + 1) && 1 == cond) && 1 <= y) && x == r + q * y) && x <= 10) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x)) || ((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 1 <= y) && x == r + q * y) && x <= 10) && x < 8 * y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((cond == 1 && 1 == cond) && 2 * (b * -1 / -2) <= r) && 0 <= r) && 1 <= y) && a == 2) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) || (((((((((((cond == 1 && 1 == cond) && a == 4) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0)) || (r < 2 * b && (((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && a == 1) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == y) && 8 * y <= x) && r + 8 * y == x) || ((((((((q == 4 && cond == 1) && 1 <= cond) && r + 4 * y == x) && 0 <= r) && x <= 10) || ((((((x == r + y && cond == 1) && 1 <= cond) && 0 <= r) && q == 1) || ((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 2 * y <= x)) && x <= 10)) && a == 1) && b == y)))) || (((((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && a == 2) && x == r + q * y) && x <= 10) && x < 8 * y) && 2 * y <= r) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && x == r + q * y) && x <= 10) && 2 * y <= r) && y == y * (a * -1 / -2)) && b == 2 * (y * (a * -1 / -2))) && r == x) && a % -2 == 0)) || (((((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x) && a % -2 == 0) && a == 8)) || (((((((((cond == 1 && r < 2 * b) && 1 == cond) && 0 <= r) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && r == x) && b == y)) || (((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && y <= (x + r * -1) / 2 / 2 / 2) && x == r + q * y) && x <= 10) && y <= 10) && b == y)) || ((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 0 <= r) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && x < 8 * y) && y <= 10) && b == y) - InvariantResult [Line: 38]: Loop Invariant [2021-08-26 05:13:18,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] Derived loop invariant: ((((((((((((((((cond == 1 && x == r + 6 * y) && 1 <= cond) && 6 * y <= x) && q == 6) && x <= 10) && x < 8 * y) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) || ((((((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && x <= 10) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && q == 10) && y <= 10) && a % -2 == 0) && (\exists aux_div_ULTIMATE.start_main_~b~0_36 : int :: y <= (x + aux_div_ULTIMATE.start_main_~b~0_36 * 2 + r * -1) / 2 / 2 / 2 && y + aux_div_ULTIMATE.start_main_~b~0_36 <= 0))) || ((((((((cond == 1 && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x)) || ((r < y && b <= y) && (((((x == r + y && 1 <= y) && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y))) && q == 1) && b == y) || ((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && 2 * r < x) && q == 2) && x == r + 2 * y) && 2 * y <= x)))) || (((((((((((cond == 1 && 1 <= cond) && r + 4 * y == x) && x == b + r) && 1 <= y) && a == q) && x <= 10) && x < 8 * y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && r < y) && x == r + q * y) && x <= 10) && 0 <= x) && b == y)) || ((((((((((cond == 1 && 1 <= cond) && q == 8) && x == b + r) && 1 <= y) && a == q) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((-1 + r * -1) / -2 < y + 1 && (((((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x) || ((((((((q == 4 && cond == 1) && 4 * y <= x) && 1 <= cond) && r + 4 * y == x) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || (((((((x == r + y && 1 <= y) && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y))) && q == 1) && b == y) || ((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 10) || (1 <= y && ((((((cond == 1 && 1 <= cond) && 0 <= y) && b == 2 * y) && a == 2) && y <= 10) || (((((cond == 1 && 1 <= cond) && 0 <= y) && a == 1) && y <= 10) && b == y)))) && 2 * r < x) && q == 2) && x == r + 2 * y) && 2 * y <= x)) && x <= 10) && a % -2 == 0))) && b * -1 / -2 <= y) - InvariantResult [Line: 14]: Loop Invariant [2021-08-26 05:13:18,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,881 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,881 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] [2021-08-26 05:13:18,881 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~b~0_36,QUANTIFIED] Derived loop invariant: ((((((((((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && x <= 10) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && q == 10) && y <= 10) && a % -2 == 0) && (\exists aux_div_ULTIMATE.start_main_~b~0_36 : int :: y <= (x + aux_div_ULTIMATE.start_main_~b~0_36 * 2 + r * -1) / 2 / 2 / 2 && y + aux_div_ULTIMATE.start_main_~b~0_36 <= 0)) || (((((((((cond == 1 && r < y) && 1 == cond) && 1 <= y) && a == 1) && x == r + q * y) && x <= 10) && y <= 10) && 0 <= x) && b == y)) || ((((((((((cond == 1 && 1 == cond) && q == 8) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0)) || (((((((((((cond == 1 && x == r + 6 * y) && 6 * y <= x) && 1 == cond) && q == 6) && 1 <= y) && x <= 10) && x < 8 * y) && b * -1 / -2 <= y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || ((r < y && b <= y) && ((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y) || ((((((2 * r < x && cond == 1) && q == 2) && x == r + 2 * y) && 1 <= y) && 2 * y <= x) && y <= 10)))) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && r == x)) || (((-1 + r * -1) / -2 < y + 1 && ((((((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 == cond) && 1 <= y) && q % 2 == 0) && x <= 10) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x) || (((((((((q == 4 && cond == 1) && 4 * y <= x) && r + 4 * y == x) && 1 == cond) && 1 <= y) && x <= 10) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && a % -2 == 0)) || ((((1 == cond && x <= 10) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) && ((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && a == 1) && q == 1) && y <= 10) && b == y) || ((((((2 * r < x && cond == 1) && q == 2) && x == r + 2 * y) && 1 <= y) && 2 * y <= x) && y <= 10))))) && b * -1 / -2 <= y)) || (((((((((((cond == 1 && r + 4 * y == x) && 1 == cond) && 1 <= y) && a == q) && x == r + q * y) && x <= 10) && x < 8 * y) && b == 2 * (y * (a * -1 / -2))) && y <= 10) && 0 <= x) && a % -2 == 0) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 05:13:18,921 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...