./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/hard-ll_valuebound1.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 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 11:58:23,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:58:23,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:58:23,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:58:23,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:58:23,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:58:23,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:58:23,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:58:23,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:58:23,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:58:23,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:58:23,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:58:23,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:58:23,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:58:23,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:58:23,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:58:23,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:58:23,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:58:23,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:58:23,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:58:23,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:58:23,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:58:23,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:58:23,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:58:23,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:58:23,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:58:23,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:58:23,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:58:23,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:58:23,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:58:23,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:58:23,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:58:23,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:58:23,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:58:23,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:58:23,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:58:23,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:58:23,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:58:23,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:58:23,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:58:23,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:58:23,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:58:23,409 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:58:23,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:58:23,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:58:23,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:58:23,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:58:23,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:58:23,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:58:23,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:58:23,411 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:58:23,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:58:23,411 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:58:23,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:58:23,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:58:23,412 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:58:23,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:58:23,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:58:23,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:58:23,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:58:23,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:58:23,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:58:23,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:58:23,414 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:58:23,415 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 [2023-02-15 11:58:23,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:58:23,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:58:23,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:58:23,655 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:58:23,655 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:58:23,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2023-02-15 11:58:24,722 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:58:24,853 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:58:24,854 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2023-02-15 11:58:24,858 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd64f63b/6daf4c8c4e3b4fc9ba16531e578163db/FLAGded8c0103 [2023-02-15 11:58:24,869 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd64f63b/6daf4c8c4e3b4fc9ba16531e578163db [2023-02-15 11:58:24,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:58:24,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:58:24,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:58:24,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:58:24,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:58:24,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:58:24" (1/1) ... [2023-02-15 11:58:24,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65842ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:24, skipping insertion in model container [2023-02-15 11:58:24,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:58:24" (1/1) ... [2023-02-15 11:58:24,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:58:24,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:58:25,004 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2023-02-15 11:58:25,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:58:25,035 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:58:25,045 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2023-02-15 11:58:25,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:58:25,061 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:58:25,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25 WrapperNode [2023-02-15 11:58:25,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:58:25,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:58:25,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:58:25,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:58:25,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,082 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-02-15 11:58:25,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:58:25,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:58:25,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:58:25,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:58:25,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,097 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:58:25,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:58:25,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:58:25,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:58:25,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (1/1) ... [2023-02-15 11:58:25,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:58:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:25,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 11:58:25,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 11:58:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:58:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 11:58:25,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 11:58:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:58:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:58:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:58:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 11:58:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 11:58:25,221 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:58:25,223 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:58:25,420 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:58:25,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:58:25,440 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 11:58:25,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:58:25 BoogieIcfgContainer [2023-02-15 11:58:25,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:58:25,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:58:25,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:58:25,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:58:25,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:58:24" (1/3) ... [2023-02-15 11:58:25,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f1530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:58:25, skipping insertion in model container [2023-02-15 11:58:25,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:58:25" (2/3) ... [2023-02-15 11:58:25,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f1530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:58:25, skipping insertion in model container [2023-02-15 11:58:25,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:58:25" (3/3) ... [2023-02-15 11:58:25,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2023-02-15 11:58:25,480 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:58:25,480 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 11:58:25,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:58:25,549 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f3de6df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:58:25,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 11:58:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 11:58:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 11:58:25,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:25,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:25,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2023-02-15 11:58:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:25,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083712840] [2023-02-15 11:58:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 11:58:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 11:58:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 11:58:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 11:58:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:25,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083712840] [2023-02-15 11:58:25,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083712840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:58:25,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:58:25,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 11:58:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043212233] [2023-02-15 11:58:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:58:25,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 11:58:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 11:58:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 11:58:25,743 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 11:58:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:25,764 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2023-02-15 11:58:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 11:58:25,767 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-15 11:58:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:25,777 INFO L225 Difference]: With dead ends: 63 [2023-02-15 11:58:25,777 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 11:58:25,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 11:58:25,786 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:25,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:58:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 11:58:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 11:58:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 11:58:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2023-02-15 11:58:25,831 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2023-02-15 11:58:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:25,832 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2023-02-15 11:58:25,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 11:58:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2023-02-15 11:58:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 11:58:25,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:25,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 11:58:25,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2023-02-15 11:58:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:25,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535568028] [2023-02-15 11:58:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 11:58:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 11:58:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 11:58:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 11:58:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:26,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535568028] [2023-02-15 11:58:26,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535568028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:58:26,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:58:26,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 11:58:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654773804] [2023-02-15 11:58:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:58:26,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 11:58:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 11:58:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:58:26,054 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 11:58:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:26,117 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-02-15 11:58:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 11:58:26,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-15 11:58:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:26,119 INFO L225 Difference]: With dead ends: 42 [2023-02-15 11:58:26,120 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 11:58:26,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 11:58:26,122 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:26,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:58:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 11:58:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-02-15 11:58:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 11:58:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-15 11:58:26,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2023-02-15 11:58:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:26,133 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-15 11:58:26,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 11:58:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-15 11:58:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 11:58:26,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:26,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 11:58:26,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2023-02-15 11:58:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:26,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434469665] [2023-02-15 11:58:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 11:58:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 11:58:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 11:58:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 11:58:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 11:58:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434469665] [2023-02-15 11:58:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434469665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:58:26,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:58:26,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 11:58:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607295653] [2023-02-15 11:58:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:58:26,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 11:58:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 11:58:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:58:26,323 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 11:58:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:26,417 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-02-15 11:58:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 11:58:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-15 11:58:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:26,419 INFO L225 Difference]: With dead ends: 46 [2023-02-15 11:58:26,419 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 11:58:26,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 11:58:26,421 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:26,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:58:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 11:58:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-15 11:58:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 11:58:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-02-15 11:58:26,437 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2023-02-15 11:58:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:26,438 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-02-15 11:58:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 11:58:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-02-15 11:58:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 11:58:26,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:26,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:26,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 11:58:26,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2023-02-15 11:58:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821804776] [2023-02-15 11:58:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:26,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:58:26,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354868944] [2023-02-15 11:58:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:26,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:58:26,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 11:58:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:26,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 11:58:26,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:58:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 11:58:26,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:58:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 11:58:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821804776] [2023-02-15 11:58:26,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:58:26,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354868944] [2023-02-15 11:58:26,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354868944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:58:26,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:58:26,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-15 11:58:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785626986] [2023-02-15 11:58:26,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:58:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 11:58:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 11:58:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-15 11:58:26,966 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 11:58:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:27,292 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-02-15 11:58:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 11:58:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2023-02-15 11:58:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:27,297 INFO L225 Difference]: With dead ends: 69 [2023-02-15 11:58:27,297 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 11:58:27,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-15 11:58:27,304 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:27,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 111 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 11:58:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 11:58:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-02-15 11:58:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-15 11:58:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-02-15 11:58:27,342 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2023-02-15 11:58:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:27,342 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-02-15 11:58:27,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 11:58:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-02-15 11:58:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 11:58:27,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:27,349 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 11:58:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:27,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2023-02-15 11:58:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:27,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241611297] [2023-02-15 11:58:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:27,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:58:27,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853147335] [2023-02-15 11:58:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:27,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:27,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:58:27,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 11:58:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:27,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 11:58:27,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:58:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 11:58:27,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:58:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 11:58:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241611297] [2023-02-15 11:58:28,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:58:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853147335] [2023-02-15 11:58:28,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853147335] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:58:28,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:58:28,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-15 11:58:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150111024] [2023-02-15 11:58:28,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:58:28,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 11:58:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 11:58:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-15 11:58:28,374 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-15 11:58:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:29,092 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-02-15 11:58:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 11:58:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41 [2023-02-15 11:58:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:29,095 INFO L225 Difference]: With dead ends: 66 [2023-02-15 11:58:29,096 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 11:58:29,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-02-15 11:58:29,097 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:29,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 11:58:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 11:58:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 11:58:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-15 11:58:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-15 11:58:29,118 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 41 [2023-02-15 11:58:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:29,119 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-15 11:58:29,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-15 11:58:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-15 11:58:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 11:58:29,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:29,123 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:29,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 11:58:29,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:29,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -677073599, now seen corresponding path program 1 times [2023-02-15 11:58:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:29,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575047056] [2023-02-15 11:58:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:29,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:58:29,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147121772] [2023-02-15 11:58:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:29,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:29,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:58:29,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 11:58:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:29,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 11:58:29,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:58:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-15 11:58:29,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:58:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:29,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575047056] [2023-02-15 11:58:29,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:58:29,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147121772] [2023-02-15 11:58:29,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147121772] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:58:29,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:58:29,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 11:58:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121861054] [2023-02-15 11:58:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:58:29,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:58:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:58:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:58:29,452 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-15 11:58:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:29,496 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-02-15 11:58:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 11:58:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 69 [2023-02-15 11:58:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:29,500 INFO L225 Difference]: With dead ends: 70 [2023-02-15 11:58:29,500 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 11:58:29,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:58:29,501 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:29,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:58:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 11:58:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 11:58:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 11:58:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-15 11:58:29,516 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 69 [2023-02-15 11:58:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:29,517 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-15 11:58:29,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-15 11:58:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-15 11:58:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 11:58:29,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:29,518 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 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, 1, 1] [2023-02-15 11:58:29,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 11:58:29,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:29,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1754894755, now seen corresponding path program 1 times [2023-02-15 11:58:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:29,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080682835] [2023-02-15 11:58:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:29,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:58:29,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176919965] [2023-02-15 11:58:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:29,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:58:29,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 11:58:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:29,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 11:58:29,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:58:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-02-15 11:58:30,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:58:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-15 11:58:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:33,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080682835] [2023-02-15 11:58:33,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:58:33,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176919965] [2023-02-15 11:58:33,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176919965] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:58:33,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:58:33,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-02-15 11:58:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975208551] [2023-02-15 11:58:33,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:58:33,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 11:58:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 11:58:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-02-15 11:58:33,913 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-15 11:58:41,430 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 53 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 11:58:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:44,567 INFO L93 Difference]: Finished difference Result 145 states and 178 transitions. [2023-02-15 11:58:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 11:58:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) Word has length 71 [2023-02-15 11:58:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:44,569 INFO L225 Difference]: With dead ends: 145 [2023-02-15 11:58:44,569 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 11:58:44,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-02-15 11:58:44,571 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:44,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 183 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-02-15 11:58:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 11:58:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2023-02-15 11:58:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 66 states have internal predecessors, (70), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-15 11:58:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2023-02-15 11:58:44,592 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 71 [2023-02-15 11:58:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:44,593 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2023-02-15 11:58:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-15 11:58:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2023-02-15 11:58:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-15 11:58:44,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:58:44,594 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 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, 1] [2023-02-15 11:58:44,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 11:58:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:44,799 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:58:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:58:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1620227847, now seen corresponding path program 1 times [2023-02-15 11:58:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:58:44,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388484323] [2023-02-15 11:58:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:58:44,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:58:44,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099076989] [2023-02-15 11:58:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:58:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:58:44,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:58:44,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 11:58:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:58:44,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 11:58:44,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:58:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 49 proven. 13 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-15 11:58:46,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:58:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:58:47,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388484323] [2023-02-15 11:58:47,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:58:47,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099076989] [2023-02-15 11:58:47,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099076989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:58:47,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 11:58:47,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-15 11:58:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833482083] [2023-02-15 11:58:47,802 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 11:58:47,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 11:58:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:58:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 11:58:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-15 11:58:47,804 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-15 11:58:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:58:48,856 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2023-02-15 11:58:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 11:58:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 82 [2023-02-15 11:58:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:58:48,857 INFO L225 Difference]: With dead ends: 117 [2023-02-15 11:58:48,857 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 11:58:48,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2023-02-15 11:58:48,858 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 11:58:48,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 11:58:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 11:58:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 11:58:48,859 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) [2023-02-15 11:58:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 11:58:48,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-02-15 11:58:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:58:48,860 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 11:58:48,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-15 11:58:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 11:58:48,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 11:58:48,862 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 11:58:48,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 11:58:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:58:49,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 11:58:50,979 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) (<= 1 .cse0))) [2023-02-15 11:58:50,979 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-02-15 11:58:50,979 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 63) the Hoare annotation is: true [2023-02-15 11:58:50,979 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse4 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse1 (<= 1 .cse0)) (.cse2 (<= .cse4 1)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| .cse4))) (or (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3) (and .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) (= (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~d~0#1|) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse4) .cse3)))) [2023-02-15 11:58:50,979 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 11:58:50,979 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-02-15 11:58:50,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 11:58:50,979 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 1) [2023-02-15 11:58:50,980 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 1)) [2023-02-15 11:58:50,980 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse4 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse1 (<= 1 .cse0)) (.cse2 (<= .cse4 1)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| .cse4))) (or (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3) (and .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) (= (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~d~0#1|) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse4) .cse3)))) [2023-02-15 11:58:50,981 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse4 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse1 (<= 1 .cse0)) (.cse2 (<= .cse4 1)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| .cse4))) (or (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3) (and .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) (= (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~d~0#1|) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse4) .cse3)))) [2023-02-15 11:58:50,981 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 11:58:50,981 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-15 11:58:50,981 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-02-15 11:58:50,981 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse3 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse1 1)) (.cse2 (= (* |ULTIMATE.start_main_~p~0#1| .cse3) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse1))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1) (<= 0 |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) .cse2 (<= .cse1 (* 2 |ULTIMATE.start_main_~d~0#1|)) (<= 1 .cse1)) (and (<= 1 .cse3) .cse0 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) .cse2 (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1) .cse4) (and (<= .cse3 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse3) (= |ULTIMATE.start_main_~q~0#1| 0) .cse4 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse3))))) [2023-02-15 11:58:50,981 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (or (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| .cse1) (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse0)) (and (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1) (= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int)) (let ((.cse3 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296))) (let ((.cse2 (+ .cse3 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| (* |aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| 4294967296)))) (and (<= .cse2 1) (<= (+ .cse1 1) (+ (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 8589934592) (* |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 2))) (<= 0 .cse2) (< (+ .cse3 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67|) 4294967296) (= (+ (* |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) .cse1) (< |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296))))) (= |ULTIMATE.start_main_~q~0#1| 1) (<= .cse1 (* 2 |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse1) (<= 1 .cse1)))) [2023-02-15 11:58:50,981 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 11:58:50,982 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse4 (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (let ((.cse1 (<= 1 .cse0)) (.cse2 (<= .cse4 1)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| .cse4))) (or (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3) (and .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) (= (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~d~0#1|) (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse4) .cse3)))) [2023-02-15 11:58:50,982 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-02-15 11:58:50,982 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-15 11:58:50,982 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse0 (<= .cse1 1)) (.cse2 (= (* |ULTIMATE.start_main_~p~0#1| .cse3) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| .cse1))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1) (<= 0 |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~q~0#1| 1) .cse2 (<= .cse1 (* 2 |ULTIMATE.start_main_~d~0#1|)) (<= 1 .cse1)) (and (<= 1 .cse3) .cse0 (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) .cse2 (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse3) |ULTIMATE.start_main_~r~0#1|) .cse1) .cse4) (and (<= .cse3 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse3) (= |ULTIMATE.start_main_~q~0#1| 0) .cse4 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse3))))) [2023-02-15 11:58:50,988 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse1 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse3 (= |ULTIMATE.start_main_~r~0#1| .cse1)) (.cse2 (= (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~d~0#1|))) (or (and (<= 1 .cse0) (<= .cse1 1) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= (div (- |ULTIMATE.start_main_~d~0#1|) (- 2)) |ULTIMATE.start_main_~r~0#1|) .cse2 (= (+ (* |ULTIMATE.start_main_~q~0#1| .cse0) |ULTIMATE.start_main_~r~0#1|) .cse1) .cse3) (and (<= .cse0 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 (<= (+ |ULTIMATE.start_main_~r~0#1| 1) .cse0)) (and (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| Int)) (let ((.cse5 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296))) (let ((.cse4 (+ .cse5 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| (* |aux_div_aux_mod_ULTIMATE.start_main_~B~0#1_45_56| 4294967296)))) (and (<= .cse4 1) (<= (+ .cse1 1) (+ (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 8589934592) (* |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 2))) (<= 0 .cse4) (< (+ .cse5 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67|) 4294967296) (<= 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67|) (= (+ (* |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) .cse1) (< |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~B~0#1_45_56_67| 4294967296))))) (<= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~q~0#1| 1) .cse2 (<= .cse1 (* 2 |ULTIMATE.start_main_~d~0#1|)) (<= 1 .cse1))))) [2023-02-15 11:58:50,989 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-02-15 11:58:50,989 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-15 11:58:50,989 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-02-15 11:58:50,989 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-02-15 11:58:50,989 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-02-15 11:58:50,990 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-15 11:58:50,990 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-15 11:58:50,990 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-15 11:58:50,990 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-15 11:58:50,992 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-15 11:58:50,992 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-15 11:58:50,994 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:58:50,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:58:51,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:58:51 BoogieIcfgContainer [2023-02-15 11:58:51,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:58:51,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:58:51,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:58:51,010 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:58:51,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:58:25" (3/4) ... [2023-02-15 11:58:51,012 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 11:58:51,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-15 11:58:51,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 11:58:51,020 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-15 11:58:51,020 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 11:58:51,020 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 11:58:51,021 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 11:58:51,045 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:58:51,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:58:51,046 INFO L158 Benchmark]: Toolchain (without parser) took 26173.60ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 94.3MB in the beginning and 71.3MB in the end (delta: 23.0MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,046 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:58:51,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.19ms. Allocated memory is still 130.0MB. Free memory was 93.9MB in the beginning and 83.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.89ms. Allocated memory is still 130.0MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,047 INFO L158 Benchmark]: Boogie Preprocessor took 16.45ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,047 INFO L158 Benchmark]: RCFGBuilder took 343.40ms. Allocated memory is still 130.0MB. Free memory was 80.8MB in the beginning and 69.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,048 INFO L158 Benchmark]: TraceAbstraction took 25563.96ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 69.2MB in the beginning and 74.5MB in the end (delta: -5.3MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,048 INFO L158 Benchmark]: Witness Printer took 36.41ms. Allocated memory is still 188.7MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 11:58:51,049 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.17ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.19ms. Allocated memory is still 130.0MB. Free memory was 93.9MB in the beginning and 83.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.89ms. Allocated memory is still 130.0MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.45ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.40ms. Allocated memory is still 130.0MB. Free memory was 80.8MB in the beginning and 69.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25563.96ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 69.2MB in the beginning and 74.5MB in the end (delta: -5.3MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Witness Printer took 36.41ms. Allocated memory is still 188.7MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1529 IncrementalHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 255 mSDtfsCounter, 1529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 68 PreInvPairs, 92 NumberOfFragments, 844 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1128 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 509 ConstructedInterpolants, 3 QuantifiedInterpolants, 4048 SizeOfPredicates, 27 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 743/798 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 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((A % 4294967296 <= 1 && d + r <= A % 4294967296) && 0 <= r) && q == 1) && p * (B % 4294967296) == d) && A % 4294967296 <= 2 * d) && 1 <= A % 4294967296) || ((((((1 <= B % 4294967296 && A % 4294967296 <= 1) && 2 <= p) && -d / -2 <= r) && p * (B % 4294967296) == d) && q * (B % 4294967296) + r == A % 4294967296) && r == A % 4294967296)) || (((((B % 4294967296 <= 1 && p == 1) && d == B % 4294967296) && q == 0) && r == A % 4294967296) && r + 1 <= B % 4294967296) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((B % 4294967296 <= 1 && p == 1) && d == B % 4294967296) && 1 <= B % 4294967296) && A % 4294967296 <= 1) && q == 0) && r == A % 4294967296) || ((((((1 <= B % 4294967296 && A % 4294967296 <= 1) && 2 <= p) && -d / -2 <= r) && p * (B % 4294967296) == d) && q * (B % 4294967296) + r == A % 4294967296) && r == A % 4294967296) RESULT: Ultimate proved your program to be correct! [2023-02-15 11:58:51,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE