./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.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_valuebound100.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 40bf339a847439ba10959c396a85884137053259 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 05:12:53,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 05:12:53,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 05:12:53,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 05:12:53,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 05:12:53,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 05:12:53,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 05:12:53,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 05:12:53,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 05:12:53,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 05:12:53,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 05:12:53,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 05:12:53,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 05:12:53,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 05:12:53,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 05:12:53,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 05:12:53,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 05:12:53,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 05:12:53,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 05:12:53,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 05:12:53,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 05:12:53,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 05:12:53,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 05:12:53,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 05:12:53,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 05:12:53,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 05:12:53,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 05:12:53,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 05:12:53,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 05:12:53,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 05:12:53,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 05:12:53,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 05:12:53,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 05:12:53,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 05:12:53,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 05:12:53,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 05:12:53,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 05:12:53,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 05:12:53,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 05:12:53,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 05:12:53,601 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:53,622 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 05:12:53,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 05:12:53,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 05:12:53,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 05:12:53,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 05:12:53,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 05:12:53,625 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 05:12:53,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 05:12:53,625 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 05:12:53,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 05:12:53,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 05:12:53,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 05:12:53,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 05:12:53,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 05:12:53,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 05:12:53,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 05:12:53,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 05:12:53,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:12:53,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 05:12:53,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 05:12:53,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 05:12:53,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 05:12:53,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 05:12:53,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 05:12:53,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 05:12:53,629 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 -> 40bf339a847439ba10959c396a85884137053259 [2021-08-26 05:12:53,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 05:12:53,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 05:12:53,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 05:12:53,948 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 05:12:53,948 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 05:12:53,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.c [2021-08-26 05:12:54,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5d0617f/3a8f8608afbb42869650934d89da2941/FLAGb91183050 [2021-08-26 05:12:54,442 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 05:12:54,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.c [2021-08-26 05:12:54,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5d0617f/3a8f8608afbb42869650934d89da2941/FLAGb91183050 [2021-08-26 05:12:54,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5d0617f/3a8f8608afbb42869650934d89da2941 [2021-08-26 05:12:54,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 05:12:54,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 05:12:54,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 05:12:54,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 05:12:54,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 05:12:54,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:12:54" (1/1) ... [2021-08-26 05:12:54,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cf2859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:54, skipping insertion in model container [2021-08-26 05:12:54,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:12:54" (1/1) ... [2021-08-26 05:12:54,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 05:12:54,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 05:12:55,057 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_valuebound100.c[576,589] [2021-08-26 05:12:55,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:12:55,098 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 05:12:55,107 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_valuebound100.c[576,589] [2021-08-26 05:12:55,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:12:55,146 INFO L208 MainTranslator]: Completed translation [2021-08-26 05:12:55,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:55 WrapperNode [2021-08-26 05:12:55,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 05:12:55,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 05:12:55,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 05:12:55,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 05:12:55,159 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:55" (1/1) ... [2021-08-26 05:12:55,163 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:55" (1/1) ... [2021-08-26 05:12:55,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 05:12:55,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 05:12:55,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 05:12:55,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 05:12:55,207 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:55" (1/1) ... [2021-08-26 05:12:55,208 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:55" (1/1) ... [2021-08-26 05:12:55,221 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:55" (1/1) ... [2021-08-26 05:12:55,221 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:55" (1/1) ... [2021-08-26 05:12:55,223 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:55" (1/1) ... [2021-08-26 05:12:55,226 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:55" (1/1) ... [2021-08-26 05:12:55,227 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:55" (1/1) ... [2021-08-26 05:12:55,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 05:12:55,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 05:12:55,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 05:12:55,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 05:12:55,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:55" (1/1) ... [2021-08-26 05:12:55,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:12:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:55,267 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:55,322 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:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 05:12:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 05:12:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 05:12:55,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 05:12:55,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 05:12:55,569 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-26 05:12:55,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:12:55 BoogieIcfgContainer [2021-08-26 05:12:55,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 05:12:55,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 05:12:55,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 05:12:55,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 05:12:55,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:12:54" (1/3) ... [2021-08-26 05:12:55,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58342220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:12:55, skipping insertion in model container [2021-08-26 05:12:55,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:12:55" (2/3) ... [2021-08-26 05:12:55,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58342220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:12:55, skipping insertion in model container [2021-08-26 05:12:55,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:12:55" (3/3) ... [2021-08-26 05:12:55,575 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound100.c [2021-08-26 05:12:55,577 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 05:12:55,578 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-08-26 05:12:55,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 05:12:55,607 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:55,607 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-26 05:12:55,615 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:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:12:55,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:55,619 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:55,619 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:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2021-08-26 05:12:55,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:55,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669515538] [2021-08-26 05:12:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:55,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:55,727 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:55,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:55,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669515538] [2021-08-26 05:12:55,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669515538] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:55,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:55,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 05:12:55,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735602178] [2021-08-26 05:12:55,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 05:12:55,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 05:12:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:12:55,741 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:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:55,751 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-08-26 05:12:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 05:12:55,752 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:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:55,757 INFO L225 Difference]: With dead ends: 83 [2021-08-26 05:12:55,757 INFO L226 Difference]: Without dead ends: 39 [2021-08-26 05:12:55,759 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:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-26 05:12:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-26 05:12:55,786 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:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-08-26 05:12:55,788 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2021-08-26 05:12:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:55,788 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-08-26 05:12:55,788 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:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-08-26 05:12:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 05:12:55,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:55,789 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:55,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 05:12:55,789 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:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2021-08-26 05:12:55,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:55,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074754725] [2021-08-26 05:12:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:55,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:55,803 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:55,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20508991] [2021-08-26 05:12:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:55,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:55,833 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:55,883 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:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:55,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:12:55,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:56,259 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:56,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:56,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074754725] [2021-08-26 05:12:56,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:56,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20508991] [2021-08-26 05:12:56,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20508991] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:56,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:56,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:12:56,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421951730] [2021-08-26 05:12:56,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:12:56,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:56,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:12:56,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:56,266 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:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:56,408 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-08-26 05:12:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:56,408 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:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:56,409 INFO L225 Difference]: With dead ends: 52 [2021-08-26 05:12:56,409 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 05:12:56,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:12:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 05:12:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-08-26 05:12:56,415 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:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-08-26 05:12:56,416 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2021-08-26 05:12:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:56,416 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-08-26 05:12:56,417 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:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-08-26 05:12:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 05:12:56,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:56,417 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:12:56,451 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:56,634 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:56,635 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:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2021-08-26 05:12:56,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:56,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268767579] [2021-08-26 05:12:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:56,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:56,645 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:56,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437511744] [2021-08-26 05:12:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:56,646 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:56,662 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:56,662 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:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:56,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:12:56,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:56,886 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:56,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:56,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268767579] [2021-08-26 05:12:56,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:56,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437511744] [2021-08-26 05:12:56,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437511744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:56,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:56,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:12:56,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430968202] [2021-08-26 05:12:56,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:12:56,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:12:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:12:56,891 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:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:57,040 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-26 05:12:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:57,040 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:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:57,042 INFO L225 Difference]: With dead ends: 69 [2021-08-26 05:12:57,042 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:12:57,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 119.9ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:12:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:12:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-08-26 05:12:57,056 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:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-08-26 05:12:57,058 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2021-08-26 05:12:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:57,058 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-08-26 05:12:57,059 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:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-08-26 05:12:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 05:12:57,059 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:57,059 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:57,093 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:57,277 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:57,279 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:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2021-08-26 05:12:57,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:57,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947713003] [2021-08-26 05:12:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:57,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:57,289 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:57,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731407193] [2021-08-26 05:12:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:57,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:57,307 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:57,309 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:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:57,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 05:12:57,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:57,408 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:57,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:57,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947713003] [2021-08-26 05:12:57,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:57,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731407193] [2021-08-26 05:12:57,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731407193] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:57,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:57,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 05:12:57,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269292340] [2021-08-26 05:12:57,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 05:12:57,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 05:12:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 05:12:57,410 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:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:57,458 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-08-26 05:12:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 05:12:57,458 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:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:57,459 INFO L225 Difference]: With dead ends: 95 [2021-08-26 05:12:57,459 INFO L226 Difference]: Without dead ends: 89 [2021-08-26 05:12:57,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:12:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-26 05:12:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2021-08-26 05:12:57,464 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:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-08-26 05:12:57,464 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 16 [2021-08-26 05:12:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:57,464 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-08-26 05:12:57,465 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:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-08-26 05:12:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 05:12:57,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:57,465 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:57,486 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:57,682 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:57,682 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:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2015957290, now seen corresponding path program 1 times [2021-08-26 05:12:57,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:57,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788261766] [2021-08-26 05:12:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:57,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:57,691 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:57,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668933392] [2021-08-26 05:12:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:57,692 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:57,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:57,707 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:57,708 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:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:57,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 05:12:57,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:57,872 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:57,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:57,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788261766] [2021-08-26 05:12:57,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:57,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668933392] [2021-08-26 05:12:57,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668933392] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:12:57,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:12:57,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 05:12:57,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757473482] [2021-08-26 05:12:57,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:12:57,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:12:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:57,875 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:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:57,946 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2021-08-26 05:12:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:57,946 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:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:57,947 INFO L225 Difference]: With dead ends: 72 [2021-08-26 05:12:57,947 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 05:12:57,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:12:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 05:12:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-26 05:12:57,951 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:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2021-08-26 05:12:57,951 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 20 [2021-08-26 05:12:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2021-08-26 05:12:57,952 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:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2021-08-26 05:12:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 05:12:57,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:57,953 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:57,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-26 05:12:58,169 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:58,170 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:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2021-08-26 05:12:58,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:58,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890446811] [2021-08-26 05:12:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:58,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:58,179 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:58,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967650247] [2021-08-26 05:12:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:58,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:58,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:58,189 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:58,190 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:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:58,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 05:12:58,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:58,381 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:58,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:58,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890446811] [2021-08-26 05:12:58,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:58,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967650247] [2021-08-26 05:12:58,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967650247] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:58,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:58,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-08-26 05:12:58,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521956561] [2021-08-26 05:12:58,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:12:58,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:12:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:12:58,383 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:58,464 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-08-26 05:12:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 05:12:58,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:58,465 INFO L225 Difference]: With dead ends: 123 [2021-08-26 05:12:58,465 INFO L226 Difference]: Without dead ends: 117 [2021-08-26 05:12:58,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-26 05:12:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2021-08-26 05:12:58,471 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:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-08-26 05:12:58,471 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 25 [2021-08-26 05:12:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:58,472 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-08-26 05:12:58,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-08-26 05:12:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 05:12:58,472 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:58,473 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:58,491 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:58,689 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:58,689 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:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2021-08-26 05:12:58,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:58,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996030855] [2021-08-26 05:12:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:58,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:58,697 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:58,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511639970] [2021-08-26 05:12:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:58,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:58,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:58,707 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:58,708 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:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:12:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 05:12:58,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:58,966 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:58,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:58,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996030855] [2021-08-26 05:12:58,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:58,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511639970] [2021-08-26 05:12:58,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511639970] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:58,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:58,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:12:58,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140740907] [2021-08-26 05:12:58,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:12:58,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:12:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:12:58,970 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:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:59,080 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2021-08-26 05:12:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:12:59,081 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:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:59,082 INFO L225 Difference]: With dead ends: 140 [2021-08-26 05:12:59,082 INFO L226 Difference]: Without dead ends: 132 [2021-08-26 05:12:59,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:12:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-26 05:12:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2021-08-26 05:12:59,098 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:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-08-26 05:12:59,099 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 26 [2021-08-26 05:12:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:59,101 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-08-26 05:12:59,101 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:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-08-26 05:12:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 05:12:59,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:59,103 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:59,121 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:59,319 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:59,319 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:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:12:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2021-08-26 05:12:59,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:12:59,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990555694] [2021-08-26 05:12:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:12:59,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:12:59,329 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:12:59,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197527456] [2021-08-26 05:12:59,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:12:59,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:12:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:12:59,346 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:59,346 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:59,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:12:59,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:12:59,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-26 05:12:59,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:12:59,643 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:59,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:12:59,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990555694] [2021-08-26 05:12:59,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:12:59,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197527456] [2021-08-26 05:12:59,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197527456] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:12:59,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:12:59,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:12:59,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184230182] [2021-08-26 05:12:59,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:12:59,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:12:59,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:12:59,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:12:59,644 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:12:59,790 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2021-08-26 05:12:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:12:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:12:59,792 INFO L225 Difference]: With dead ends: 168 [2021-08-26 05:12:59,792 INFO L226 Difference]: Without dead ends: 162 [2021-08-26 05:12:59,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:12:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-26 05:12:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2021-08-26 05:12:59,798 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:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2021-08-26 05:12:59,799 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 34 [2021-08-26 05:12:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:12:59,799 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2021-08-26 05:12:59,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2021-08-26 05:12:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-26 05:12:59,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:12:59,800 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:59,823 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:13:00,020 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:13:00,021 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:13:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2021-08-26 05:13:00,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:00,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420011647] [2021-08-26 05:13:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:00,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:00,029 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:00,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797458579] [2021-08-26 05:13:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:00,030 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:00,030 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:13:00,031 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:13:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:00,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 05:13:00,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:00,460 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:13:00,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:00,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420011647] [2021-08-26 05:13:00,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:00,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797458579] [2021-08-26 05:13:00,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797458579] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:00,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:00,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:00,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740164965] [2021-08-26 05:13:00,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:00,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:00,462 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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:13:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:00,592 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2021-08-26 05:13:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:13:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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:13:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:00,593 INFO L225 Difference]: With dead ends: 208 [2021-08-26 05:13:00,593 INFO L226 Difference]: Without dead ends: 200 [2021-08-26 05:13:00,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:13:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-08-26 05:13:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 128. [2021-08-26 05:13:00,599 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:13:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-08-26 05:13:00,599 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 35 [2021-08-26 05:13:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:00,600 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-08-26 05:13:00,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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:13:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-08-26 05:13:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 05:13:00,600 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:00,601 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:13:00,645 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:13:00,815 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:13:00,816 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:13:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1158953764, now seen corresponding path program 2 times [2021-08-26 05:13:00,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:00,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050836060] [2021-08-26 05:13:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:00,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:00,823 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:00,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875577944] [2021-08-26 05:13:00,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:00,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:00,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:00,841 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:13:00,882 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:13:01,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:01,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:01,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 05:13:01,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:01,129 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:13:01,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:01,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050836060] [2021-08-26 05:13:01,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:01,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875577944] [2021-08-26 05:13:01,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875577944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:13:01,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:13:01,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 05:13:01,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160797545] [2021-08-26 05:13:01,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:13:01,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:13:01,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:13:01,130 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:13:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:01,167 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2021-08-26 05:13:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:13:01,167 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:13:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:01,168 INFO L225 Difference]: With dead ends: 241 [2021-08-26 05:13:01,168 INFO L226 Difference]: Without dead ends: 142 [2021-08-26 05:13:01,168 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-26 05:13:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2021-08-26 05:13:01,173 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:13:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-08-26 05:13:01,174 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 39 [2021-08-26 05:13:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:01,174 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-08-26 05:13:01,174 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:13:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-08-26 05:13:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-26 05:13:01,174 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:01,175 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:13:01,205 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:13:01,405 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:13:01,405 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:13:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1020421613, now seen corresponding path program 3 times [2021-08-26 05:13:01,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:01,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832637041] [2021-08-26 05:13:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:01,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:01,412 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:01,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956643925] [2021-08-26 05:13:01,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:01,413 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:01,417 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:13:01,445 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:13:01,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 05:13:01,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:01,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 05:13:01,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:01,840 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:13:01,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:01,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832637041] [2021-08-26 05:13:01,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:01,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956643925] [2021-08-26 05:13:01,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956643925] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:01,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:01,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:13:01,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248042480] [2021-08-26 05:13:01,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:01,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:01,842 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:13:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:13,874 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2021-08-26 05:13:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:13:13,875 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:13:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:13,875 INFO L225 Difference]: With dead ends: 142 [2021-08-26 05:13:13,875 INFO L226 Difference]: Without dead ends: 136 [2021-08-26 05:13:13,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 5793.2ms TimeCoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2021-08-26 05:13:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-26 05:13:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 87. [2021-08-26 05:13:13,889 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:13:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-08-26 05:13:13,890 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 43 [2021-08-26 05:13:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:13,890 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-08-26 05:13:13,890 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:13:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-08-26 05:13:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 05:13:13,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:13,891 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:13:13,921 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:13:14,121 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:13:14,122 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:13:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2021-08-26 05:13:14,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:14,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185765437] [2021-08-26 05:13:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:14,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:14,145 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:14,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016727133] [2021-08-26 05:13:14,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:14,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:14,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:14,161 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:13:14,178 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:13:14,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:14,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:14,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-26 05:13:14,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:16,166 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:13:16,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:16,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185765437] [2021-08-26 05:13:16,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:16,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016727133] [2021-08-26 05:13:16,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016727133] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:16,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:16,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-08-26 05:13:16,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876132008] [2021-08-26 05:13:16,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 05:13:16,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 05:13:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:13:16,167 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:13:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:18,841 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2021-08-26 05:13:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 05:13:18,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:13:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:18,843 INFO L225 Difference]: With dead ends: 141 [2021-08-26 05:13:18,843 INFO L226 Difference]: Without dead ends: 133 [2021-08-26 05:13:18,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2701.4ms TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-08-26 05:13:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-26 05:13:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2021-08-26 05:13:18,855 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:13:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-08-26 05:13:18,856 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 44 [2021-08-26 05:13:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:18,856 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-08-26 05:13:18,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:13:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-08-26 05:13:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 05:13:18,857 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:18,857 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:13:18,873 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:13:19,057 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:13:19,057 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:13:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2021-08-26 05:13:19,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:19,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330168891] [2021-08-26 05:13:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:19,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:19,064 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:19,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437798349] [2021-08-26 05:13:19,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:19,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:19,073 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:13:19,097 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:13:19,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:13:19,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:19,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-26 05:13:19,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-26 05:13:20,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:20,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330168891] [2021-08-26 05:13:20,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:20,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437798349] [2021-08-26 05:13:20,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437798349] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:20,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:20,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:13:20,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196334572] [2021-08-26 05:13:20,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:13:20,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:20,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:13:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:20,260 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:13:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:20,571 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2021-08-26 05:13:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 05:13:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:13:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:20,572 INFO L225 Difference]: With dead ends: 110 [2021-08-26 05:13:20,572 INFO L226 Difference]: Without dead ends: 98 [2021-08-26 05:13:20,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 389.9ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-08-26 05:13:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-26 05:13:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2021-08-26 05:13:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 89 states have internal predecessors, (95), 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:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-08-26 05:13:20,593 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 48 [2021-08-26 05:13:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:20,593 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-08-26 05:13:20,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:13:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-08-26 05:13:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 05:13:20,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:20,595 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:13:20,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 05:13:20,812 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:13:20,812 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:13:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1934789142, now seen corresponding path program 4 times [2021-08-26 05:13:20,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:20,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091248999] [2021-08-26 05:13:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:20,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:20,819 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:20,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002303727] [2021-08-26 05:13:20,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 05:13:20,820 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:20,820 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:13:20,822 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:13:21,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 05:13:21,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:21,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-26 05:13:21,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:22,554 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:13:22,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:22,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091248999] [2021-08-26 05:13:22,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:22,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002303727] [2021-08-26 05:13:22,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002303727] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:22,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:22,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:13:22,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392159848] [2021-08-26 05:13:22,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:13:22,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:13:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:22,557 INFO L87 Difference]: Start difference. First operand 90 states and 95 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:13:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:23,422 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2021-08-26 05:13:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 05:13:23,422 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:13:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:23,423 INFO L225 Difference]: With dead ends: 145 [2021-08-26 05:13:23,423 INFO L226 Difference]: Without dead ends: 137 [2021-08-26 05:13:23,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 482.4ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-08-26 05:13:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-26 05:13:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2021-08-26 05:13:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.09375) internal successors, (105), 98 states have internal predecessors, (105), 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:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2021-08-26 05:13:23,432 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 53 [2021-08-26 05:13:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:23,433 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2021-08-26 05:13:23,433 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:13:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2021-08-26 05:13:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 05:13:23,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:23,434 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:13:23,463 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:13:23,651 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:13:23,651 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:13:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 5 times [2021-08-26 05:13:23,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:23,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785292694] [2021-08-26 05:13:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:23,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:23,659 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:23,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891773605] [2021-08-26 05:13:23,659 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 05:13:23,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:23,663 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:13:23,670 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:13:24,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-08-26 05:13:24,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:24,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 05:13:24,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:24,295 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:13:24,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:24,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785292694] [2021-08-26 05:13:24,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:24,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891773605] [2021-08-26 05:13:24,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891773605] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:24,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:24,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:24,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629304068] [2021-08-26 05:13:24,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:24,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:24,297 INFO L87 Difference]: Start difference. First operand 99 states and 105 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:13:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:24,436 INFO L93 Difference]: Finished difference Result 198 states and 208 transitions. [2021-08-26 05:13:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:13:24,437 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:13:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:24,437 INFO L225 Difference]: With dead ends: 198 [2021-08-26 05:13:24,437 INFO L226 Difference]: Without dead ends: 143 [2021-08-26 05:13:24,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:13:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-26 05:13:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2021-08-26 05:13:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 124 states have (on average 1.1048387096774193) internal successors, (137), 126 states have internal predecessors, (137), 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:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-08-26 05:13:24,449 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 57 [2021-08-26 05:13:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:24,449 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-08-26 05:13:24,449 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:13:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-08-26 05:13:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 05:13:24,450 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:24,450 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:13:24,469 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:13:24,663 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:13:24,664 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:13:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1860833829, now seen corresponding path program 6 times [2021-08-26 05:13:24,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:24,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657507361] [2021-08-26 05:13:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:24,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:24,670 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:24,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968994763] [2021-08-26 05:13:24,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 05:13:24,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:24,677 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:13:24,724 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:13:25,213 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-26 05:13:25,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:25,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 05:13:25,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:25,499 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:13:25,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:25,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657507361] [2021-08-26 05:13:25,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:25,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968994763] [2021-08-26 05:13:25,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968994763] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:25,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:25,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:13:25,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358983909] [2021-08-26 05:13:25,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:13:25,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:13:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:13:25,502 INFO L87 Difference]: Start difference. First operand 127 states and 137 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:13:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:25,659 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2021-08-26 05:13:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 05:13:25,660 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:13:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:25,661 INFO L225 Difference]: With dead ends: 146 [2021-08-26 05:13:25,661 INFO L226 Difference]: Without dead ends: 131 [2021-08-26 05:13:25,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-26 05:13:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-26 05:13:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 81. [2021-08-26 05:13:25,671 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:13:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-08-26 05:13:25,671 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 62 [2021-08-26 05:13:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:25,671 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-08-26 05:13:25,671 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:13:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-08-26 05:13:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 05:13:25,672 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:25,672 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:13:25,701 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:13:25,890 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:13:25,890 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:13:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 7 times [2021-08-26 05:13:25,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:25,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000418056] [2021-08-26 05:13:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:25,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:25,897 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:25,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533876190] [2021-08-26 05:13:25,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 05:13:25,897 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:25,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:25,900 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:13:25,901 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:13:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:13:26,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-26 05:13:26,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:27,087 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:13:27,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:27,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000418056] [2021-08-26 05:13:27,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:27,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533876190] [2021-08-26 05:13:27,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533876190] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:27,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:27,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:13:27,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850822871] [2021-08-26 05:13:27,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:13:27,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:13:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:27,092 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 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:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:27,333 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-08-26 05:13:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 05:13:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 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:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:27,334 INFO L225 Difference]: With dead ends: 135 [2021-08-26 05:13:27,334 INFO L226 Difference]: Without dead ends: 128 [2021-08-26 05:13:27,335 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 184.2ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-08-26 05:13:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-26 05:13:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2021-08-26 05:13:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2021-08-26 05:13:27,348 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 66 [2021-08-26 05:13:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:27,348 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2021-08-26 05:13:27,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 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:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2021-08-26 05:13:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 05:13:27,349 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:27,349 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:27,367 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:27,567 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:27,567 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:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash 397597340, now seen corresponding path program 8 times [2021-08-26 05:13:27,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:27,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996040014] [2021-08-26 05:13:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:27,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:27,578 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:27,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330312392] [2021-08-26 05:13:27,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:13:27,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:27,605 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:27,619 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:28,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:13:28,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:28,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 05:13:28,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 55 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:13:28,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:28,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996040014] [2021-08-26 05:13:28,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:28,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330312392] [2021-08-26 05:13:28,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330312392] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:28,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:28,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-26 05:13:28,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733717286] [2021-08-26 05:13:28,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 05:13:28,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 05:13:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:13:28,436 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:28,838 INFO L93 Difference]: Finished difference Result 196 states and 202 transitions. [2021-08-26 05:13:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 05:13:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:28,839 INFO L225 Difference]: With dead ends: 196 [2021-08-26 05:13:28,839 INFO L226 Difference]: Without dead ends: 136 [2021-08-26 05:13:28,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:13:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-26 05:13:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2021-08-26 05:13:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 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:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-08-26 05:13:28,859 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 75 [2021-08-26 05:13:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:28,859 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-08-26 05:13:28,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-08-26 05:13:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 05:13:28,861 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:13:28,862 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:28,880 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:29,078 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:29,079 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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:29,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:13:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 822588344, now seen corresponding path program 9 times [2021-08-26 05:13:29,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:13:29,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950859793] [2021-08-26 05:13:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:13:29,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:13:29,085 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:13:29,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203315718] [2021-08-26 05:13:29,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:13:29,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:29,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:13:29,087 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:13:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-26 05:13:29,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:13:29,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:13:29,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 05:13:29,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:13:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-08-26 05:13:29,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:13:29,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950859793] [2021-08-26 05:13:29,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:13:29,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203315718] [2021-08-26 05:13:29,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203315718] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:13:29,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:13:29,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-08-26 05:13:29,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537413261] [2021-08-26 05:13:29,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:13:29,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:13:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:13:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:13:29,947 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:13:30,137 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-08-26 05:13:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 05:13:30,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:13:30,149 INFO L225 Difference]: With dead ends: 121 [2021-08-26 05:13:30,149 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 05:13:30,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.2ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:13:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 05:13:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 05:13:30,150 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:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 05:13:30,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-08-26 05:13:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:13:30,150 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 05:13:30,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 05:13:30,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,152 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 05:13:30,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-26 05:13:30,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:13:30,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 05:13:30,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:30,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:30,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:30,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:30,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:30,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:31,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:31,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:31,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:31,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 05:13:41,105 WARN L207 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 183 DAG size of output: 38 [2021-08-26 05:13:46,395 WARN L207 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 188 DAG size of output: 39 [2021-08-26 05:14:00,946 WARN L207 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L853 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 100)) (.cse10 (* 2 ULTIMATE.start_main_~y~0))) (let ((.cse0 (or (and .cse4 .cse5 (= ULTIMATE.start_main_~b~0 (* 4 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~a~0 4) .cse6 .cse7) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~b~0 .cse10) (= ULTIMATE.start_main_~a~0 2)))) (.cse1 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse11 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse3 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0) .cse1 .cse2 .cse3) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~q~0 1) .cse9) (and .cse0 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse10)))) (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse11 .cse2 .cse3 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse4 .cse6 .cse7 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse1 .cse11 .cse2 .cse3 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0))))) [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,248 INFO L853 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_main_~a~0 1)) (.cse6 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 100)) (.cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse7 (<= 0 ULTIMATE.start_main_~x~0)) (.cse8 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (let ((.cse10 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (and (or (and .cse0 .cse10 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0)))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse10 (= ULTIMATE.start_main_~q~0 1))) .cse4 .cse6 .cse8 .cse9) (let ((.cse11 (div ULTIMATE.start_main_~q~0 2))) (and .cse0 (= (mod (div (- .cse11) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse11 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse10 .cse4 (= (mod ULTIMATE.start_main_~q~0 2) 0) .cse6 (= (mod .cse11 (- 2)) 0) .cse8 .cse9 (= (+ ULTIMATE.start_main_~r~0 (* 8 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0)))))) (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse7 .cse8 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:07,248 INFO L857 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse6 (<= 0 ULTIMATE.start_main_~x~0)) (.cse7 (<= ULTIMATE.start_main_~x~0 100)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 100)) (.cse4 (= ULTIMATE.start_main_~a~0 1)) (.cse8 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0)) .cse1 .cse2 .cse3 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse6 .cse7 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (or (and .cse0 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0))) .cse2 .cse3) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 1) .cse8)) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_main_~a~0 1)) (.cse8 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse13 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 100))) (let ((.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse6 (<= 0 ULTIMATE.start_main_~x~0)) (.cse9 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2)))))) (.cse7 (<= ULTIMATE.start_main_~x~0 100)) (.cse10 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (.cse11 (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) .cse0 .cse13 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 1) .cse8) (and .cse0 .cse13 (= ULTIMATE.start_main_~q~0 2) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~y~0))) .cse2 .cse3)))) (or (and .cse0 (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0)) .cse1 .cse2 .cse3 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7 .cse10) (and (or (and .cse11 .cse9 .cse6 .cse7 .cse10) (let ((.cse12 (div ULTIMATE.start_main_~q~0 2)) (.cse14 (* 8 ULTIMATE.start_main_~y~0))) (and .cse0 (= (mod (div (- .cse12) (- 2)) (- 2)) 0) (= ULTIMATE.start_main_~y~0 (* (div (* (div (* .cse12 (- 1)) (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) .cse13 .cse2 .cse3 (= (mod ULTIMATE.start_main_~q~0 2) 0) (= (mod .cse12 (- 2)) 0) .cse9 .cse7 .cse10 (<= .cse14 ULTIMATE.start_main_~x~0) (= (+ ULTIMATE.start_main_~r~0 .cse14) ULTIMATE.start_main_~x~0)))) (< (div (+ (- 1) (* ULTIMATE.start_main_~r~0 (- 1))) (- 2)) (+ ULTIMATE.start_main_~y~0 1)) (<= (div (* ULTIMATE.start_main_~b~0 (- 1)) (- 2)) ULTIMATE.start_main_~y~0)) (and .cse11 (< ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 100)) (.cse1 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)) (.cse5 (<= 0 ULTIMATE.start_main_~x~0)) (.cse6 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 (= (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~r~0 .cse1) (+ ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0))) .cse2 (<= 0 ULTIMATE.start_main_~r~0) .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse5 .cse6 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse0 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~a~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse1)) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= 1 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 100)) (.cse4 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse5 (<= 0 ULTIMATE.start_main_~x~0)) (.cse6 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 1) .cse4 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~r~0) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse5 .cse6 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (<= 1 ULTIMATE.start_main_~y~0)) (.cse2 (<= ULTIMATE.start_main_~y~0 100)) (.cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0)))) (.cse4 (<= 0 ULTIMATE.start_main_~x~0)) (.cse5 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 .cse2 (= ULTIMATE.start_main_~a~0 1) .cse3 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0) .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~r~0) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) .cse4 .cse5 (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)))) [2021-08-26 05:14:07,249 INFO L860 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L853 garLoopResultBuilder]: At program point L15-17(lines 14 20) the Hoare annotation is: (and (let ((.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)) (.cse4 (<= ULTIMATE.start_main_~y~0 100))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~y~0 (div (* ULTIMATE.start_main_~a~0 (- 1)) (- 2))))) (= (mod ULTIMATE.start_main_~a~0 (- 2)) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~a~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)) [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L860 garLoopResultBuilder]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,249 INFO L857 garLoopResultBuilder]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 05:14:07,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2021-08-26 05:14:07,256 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 05:14:07,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 05:14:07 BoogieIcfgContainer [2021-08-26 05:14:07,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 05:14:07,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 05:14:07,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 05:14:07,329 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 05:14:07,330 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:55" (3/4) ... [2021-08-26 05:14:07,331 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 05:14:07,346 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-08-26 05:14:07,348 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 05:14:07,348 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:14:07,348 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 05:14:07,410 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 05:14:07,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 05:14:07,410 INFO L168 Benchmark]: Toolchain (without parser) took 72546.52 ms. Allocated memory was 67.1 MB in the beginning and 285.2 MB in the end (delta: 218.1 MB). Free memory was 51.8 MB in the beginning and 206.0 MB in the end (delta: -154.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,411 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 48.2 MB. Free memory is still 29.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 05:14:07,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.49 ms. Allocated memory is still 67.1 MB. Free memory was 51.6 MB in the beginning and 41.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 67.1 MB. Free memory was 41.8 MB in the beginning and 50.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,412 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 67.1 MB. Free memory was 50.0 MB in the beginning and 48.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 05:14:07,412 INFO L168 Benchmark]: RCFGBuilder took 341.73 ms. Allocated memory is still 67.1 MB. Free memory was 48.8 MB in the beginning and 46.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,412 INFO L168 Benchmark]: TraceAbstraction took 71757.74 ms. Allocated memory was 67.1 MB in the beginning and 285.2 MB in the end (delta: 218.1 MB). Free memory was 46.6 MB in the beginning and 210.2 MB in the end (delta: -163.6 MB). Peak memory consumption was 228.0 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,412 INFO L168 Benchmark]: Witness Printer took 80.94 ms. Allocated memory is still 285.2 MB. Free memory was 210.2 MB in the beginning and 206.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 05:14:07,413 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.09 ms. Allocated memory is still 48.2 MB. Free memory is still 29.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 282.49 ms. Allocated memory is still 67.1 MB. Free memory was 51.6 MB in the beginning and 41.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 67.1 MB. Free memory was 41.8 MB in the beginning and 50.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.31 ms. Allocated memory is still 67.1 MB. Free memory was 50.0 MB in the beginning and 48.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 341.73 ms. Allocated memory is still 67.1 MB. Free memory was 48.8 MB in the beginning and 46.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 71757.74 ms. Allocated memory was 67.1 MB in the beginning and 285.2 MB in the end (delta: 218.1 MB). Free memory was 46.6 MB in the beginning and 210.2 MB in the end (delta: -163.6 MB). Peak memory consumption was 228.0 MB. Max. memory is 16.1 GB. * Witness Printer took 80.94 ms. Allocated memory is still 285.2 MB. Free memory was 210.2 MB in the beginning and 206.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * 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: 71650.4ms, OverallIterations: 19, TraceHistogramMax: 6, EmptinessCheckTime: 15.8ms, AutomataDifference: 18004.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 36894.3ms, InitialAbstractionConstructionTime: 6.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 555 SDtfs, 1171 SDslu, 1294 SDs, 0 SdLazy, 2774 SolverSat, 399 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8690.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 10320.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=10, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 189.8ms AutomataMinimizationTime, 19 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 104 NumberOfFragments, 1248 HoareAnnotationTreeSize, 10 FomulaSimplifications, 1506751 FormulaSimplificationTreeSizeReduction, 751.4ms HoareSimplificationTime, 10 FomulaSimplificationsInter, 535633 FormulaSimplificationTreeSizeReductionInter, 36134.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 139.7ms SsaConstructionTime, 386.1ms SatisfiabilityAnalysisTime, 7404.3ms InterpolantComputationTime, 753 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 734 ConstructedInterpolants, 0 QuantifiedInterpolants, 6798 SizeOfPredicates, 140 NumberOfNonLiveVariables, 2320 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 390/694 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 && 1 == cond) && 1 <= y) && y <= 100) && a == 1) && x == r + q * y) && y <= r) && 0 <= x) && x <= 100) && b == y) || (((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && y <= 100) && b == 2 * (y * (a * -1 / -2))) && a % -2 == 0) || ((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && y <= 100) && a == 1) && b == y)) && x == r + q * y) && 0 <= x) && x <= 100 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 100) && a == 1) && x == r + q * y) && y <= r) && 0 <= x) && x <= 100) && b == y) || (((((((((cond == 1 && 1 <= cond) && 0 <= r) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((cond == 1 && b + r + q * y == x + a * y) && 1 == cond) && 0 <= r) && 1 <= y) && y <= 100) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0) || (((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 100) && a == 1) && x == r + q * y) && y <= r) && 0 <= x) && x <= 100) && b == y) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((cond == 1 && y <= b + r) && 1 == cond) && 1 <= y) && y <= 100) && r < b) && a == 1) && x == r + q * y) && 0 <= x) && x <= 100) && b == y) || ((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0)) || (((((((((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && q == 1) && b == y) || (((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 100)) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0) || ((((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && 1 <= y) && y <= 100) && q % 2 == 0) && q / 2 % -2 == 0) && b == 2 * (y * (a * -1 / -2))) && x <= 100) && a % -2 == 0) && 8 * y <= x) && r + 8 * y == x)) && (-1 + r * -1) / -2 < y + 1) && b * -1 / -2 <= y)) || ((((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && q == 1) && b == y) || (((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 100)) && r < y) && b <= y) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 100) && a == 1) && x == r + q * y) && y <= r) && 0 <= x) && x <= 100) && b == y) || (r < 2 * b && (((((((((cond == 1 && 1 <= cond) && q == 2) && x == r + 2 * y) || (((x == r + y && cond == 1) && 1 <= cond) && q == 1)) && a == 1) && y <= r) && x <= 100) && b == y) || ((((((((((cond == 1 && -(q / 2) / -2 % -2 == 0) && y == q / 2 * -1 / -2 * -1 / -2 * y) && 1 <= cond) && a == 1) && q % 2 == 0) && y <= r) && q / 2 % -2 == 0) && x <= 100) && b == y) && r + 8 * y == x)))) || (((((((((cond == 1 && 1 == cond) && 0 <= r) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 100) || (((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && b == y)) || (((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 100) && b == 2 * y) && a == 2)) && y <= b + r) && 1 == cond) && r < b) && x == r + q * y) && 0 <= x) && x <= 100) || ((((((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && q == 1) && b == y) || (((((((((cond == 1 && 1 <= cond) && b == 4 * y) && a == 4) && 1 <= y) && y <= 100) || (((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && b == y)) || (((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 100) && b == 2 * y) && a == 2)) && q == 2) && x == r + 2 * y)) && r < y) && b <= y)) || ((((((((cond == 1 && 1 <= cond) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0)) || ((((((((cond == 1 && 1 <= y) && y <= 100) && a == q) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && r == x) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((((((cond == 1 && y <= b + r) && 1 == cond) && 1 <= y) && y <= 100) && r < b) && a == 1) && x == r + q * y) && 0 <= x) && x <= 100) && b == y) || ((((((((cond == 1 && 1 == cond) && 1 <= y) && y <= 100) && x == r + q * y) && b == 2 * (y * (a * -1 / -2))) && 0 <= x) && x <= 100) && a % -2 == 0)) || ((r < y && (((((cond == 1 && q == 2) && x == r + 2 * y) && 1 <= y) && y <= 100) || (((((((x == r + y && cond == 1) && 1 <= cond) && 1 <= y) && y <= 100) && a == 1) && q == 1) && b == y))) && b <= y) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 05:14:07,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...