/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:18:13,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:18:13,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:18:13,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:18:13,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:18:13,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:18:13,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:18:13,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:18:13,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:18:13,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:18:13,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:18:13,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:18:13,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:18:13,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:18:13,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:18:13,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:18:13,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:18:13,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:18:13,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:18:13,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:18:13,600 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:18:13,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:18:13,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:18:13,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:18:13,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:18:13,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:18:13,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:18:13,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:18:13,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:18:13,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:18:13,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:18:13,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:18:13,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:18:13,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:18:13,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:18:13,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:18:13,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:18:13,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:18:13,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:18:13,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:18:13,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:18:13,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:18:13,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:18:13,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:18:13,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:18:13,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:18:13,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:18:13,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:18:13,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:18:13,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:18:13,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:18:13,651 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:18:13,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:18:13,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:18:13,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:18:13,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:18:13,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:18:13,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:18:13,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:18:13,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:18:13,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:18:13,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:18:13,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:18:13,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:18:13,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:18:13,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:18:13,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:18:13,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:18:13,656 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:18:13,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:18:13,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:18:13,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:18:13,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:18:13,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:18:13,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:18:13,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:18:13,908 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:18:13,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound100.c [2022-04-27 12:18:13,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44166969f/2632e1842ae9405c9b5b22c8a986c312/FLAG0d9268a19 [2022-04-27 12:18:14,318 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:18:14,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound100.c [2022-04-27 12:18:14,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44166969f/2632e1842ae9405c9b5b22c8a986c312/FLAG0d9268a19 [2022-04-27 12:18:14,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44166969f/2632e1842ae9405c9b5b22c8a986c312 [2022-04-27 12:18:14,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:18:14,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:18:14,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:18:14,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:18:14,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:18:14,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:18:14" (1/1) ... [2022-04-27 12:18:14,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5706ba21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:14, skipping insertion in model container [2022-04-27 12:18:14,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:18:14" (1/1) ... [2022-04-27 12:18:14,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:18:14,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:18:14,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound100.c[525,538] [2022-04-27 12:18:14,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:18:14,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:18:14,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound100.c[525,538] [2022-04-27 12:18:14,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:18:15,016 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:18:15,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15 WrapperNode [2022-04-27 12:18:15,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:18:15,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:18:15,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:18:15,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:18:15,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:18:15,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:18:15,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:18:15,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:18:15,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (1/1) ... [2022-04-27 12:18:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:18:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:15,087 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) [2022-04-27 12:18:15,104 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 [2022-04-27 12:18:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:18:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:18:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:18:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:18:15,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:18:15,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:18:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:18:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:18:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:18:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:18:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:18:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:18:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:18:15,177 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:18:15,179 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:18:15,363 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:18:15,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:18:15,369 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:18:15,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:18:15 BoogieIcfgContainer [2022-04-27 12:18:15,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:18:15,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:18:15,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:18:15,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:18:15,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:18:14" (1/3) ... [2022-04-27 12:18:15,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38eaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:18:15, skipping insertion in model container [2022-04-27 12:18:15,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:18:15" (2/3) ... [2022-04-27 12:18:15,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38eaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:18:15, skipping insertion in model container [2022-04-27 12:18:15,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:18:15" (3/3) ... [2022-04-27 12:18:15,386 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound100.c [2022-04-27 12:18:15,419 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:18:15,420 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:18:15,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:18:15,495 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c3f2fc6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ec901a8 [2022-04-27 12:18:15,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:18:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:18:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:15,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:15,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:15,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-27 12:18:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:15,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373911572] [2022-04-27 12:18:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:15,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 12:18:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:18:15,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:18:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:15,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:18:15,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:18:15,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:18:15,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:18:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:18:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:15,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:18:15,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:18:15,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:18:15,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:18:15,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:15,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 12:18:15,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:18:15,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:18:15,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-27 12:18:15,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-27 12:18:15,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 100 then 1 else 0)); {41#true} is VALID [2022-04-27 12:18:15,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:18:15,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:18:15,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:18:15,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:18:15,775 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-27 12:18:15,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:18:15,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:18:15,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:18:15,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:18:15,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-27 12:18:15,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:18:15,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:18:15,777 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-27 12:18:15,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 12:18:15,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 12:18:15,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 12:18:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:18:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373911572] [2022-04-27 12:18:15,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373911572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:15,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:15,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:18:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543336708] [2022-04-27 12:18:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:18:15,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:15,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:15,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:15,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:18:15,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:18:15,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:18:15,848 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:18,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:22,163 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-27 12:18:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:18:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:18:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:18:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:18:22,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-27 12:18:22,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:22,320 INFO L225 Difference]: With dead ends: 69 [2022-04-27 12:18:22,320 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 12:18:22,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:18:22,325 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:22,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 12:18:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 12:18:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 12:18:22,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:22,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:22,357 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:22,357 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:22,376 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:18:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:22,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:22,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:22,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:18:22,378 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:18:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:22,383 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:18:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:22,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:22,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:22,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:22,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 12:18:22,398 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 12:18:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:22,399 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 12:18:22,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:22,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:22,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:22,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:18:22,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-27 12:18:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:22,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728148725] [2022-04-27 12:18:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:22,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {274#true} is VALID [2022-04-27 12:18:22,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:18:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:22,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:22,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:22,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:18:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:18:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:22,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:22,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:22,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:18:22,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:22,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {274#true} is VALID [2022-04-27 12:18:22,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:18:22,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-27 12:18:22,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {274#true} is VALID [2022-04-27 12:18:22,666 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 100 then 1 else 0)); {274#true} is VALID [2022-04-27 12:18:22,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:22,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:22,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:18:22,667 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {274#true} is VALID [2022-04-27 12:18:22,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:22,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:22,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:22,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:18:22,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:22,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:22,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:22,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !false; {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:22,672 INFO L272 TraceCheckUtils]: 20: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {289#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:22,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {289#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {290#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:22,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:18:22,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:18:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:18:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728148725] [2022-04-27 12:18:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728148725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:22,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:18:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920640458] [2022-04-27 12:18:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:18:22,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:22,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:22,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:22,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:18:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:18:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:18:22,698 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:32,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:35,555 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-27 12:18:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:18:35,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:18:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:18:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:18:35,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-27 12:18:35,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:35,827 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:18:35,828 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:18:35,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:18:35,830 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:35,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 53 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-04-27 12:18:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:18:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 12:18:35,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:35,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:35,854 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:35,856 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:35,863 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:18:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:35,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:35,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:35,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:18:35,871 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:18:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:35,878 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:18:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:35,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:35,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:35,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:35,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 12:18:35,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 12:18:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:35,886 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 12:18:35,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:18:35,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:35,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:35,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:18:35,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-27 12:18:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:35,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180359964] [2022-04-27 12:18:35,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:36,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:36,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:36,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:36,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:36,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:18:36,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:18:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:36,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:36,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:36,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:18:36,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:36,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:36,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:36,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-27 12:18:36,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2022-04-27 12:18:36,079 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 100 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:36,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:36,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:36,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:18:36,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:36,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:36,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:36,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:36,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:18:36,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:36,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:36,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:36,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:36,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {595#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:18:36,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:18:36,086 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:36,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {597#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:36,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {583#false} is VALID [2022-04-27 12:18:36,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-27 12:18:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 12:18:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:36,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180359964] [2022-04-27 12:18:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180359964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:36,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:36,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:18:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269355220] [2022-04-27 12:18:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:18:36,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:36,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:36,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:36,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:18:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:18:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:18:36,131 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:45,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:58,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:03,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:05,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:09,416 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-04-27 12:19:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:19:09,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:19:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 12:19:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2022-04-27 12:19:09,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2022-04-27 12:19:09,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:09,735 INFO L225 Difference]: With dead ends: 77 [2022-04-27 12:19:09,735 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 12:19:09,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:19:09,741 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 79 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:09,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 220 Invalid, 3 Unknown, 0 Unchecked, 20.0s Time] [2022-04-27 12:19:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 12:19:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-27 12:19:09,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:09,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:19:09,780 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:19:09,780 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:19:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:09,785 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 12:19:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 12:19:09,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:09,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:09,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:19:09,786 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:19:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:09,791 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-27 12:19:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-27 12:19:09,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:09,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:09,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:09,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:19:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-27 12:19:09,797 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-27 12:19:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:09,797 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-27 12:19:09,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:19:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-27 12:19:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:19:09,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:09,798 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-27 12:19:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 12:19:09,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-27 12:19:09,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:09,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326971797] [2022-04-27 12:19:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:09,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763335550] [2022-04-27 12:19:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:09,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:09,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:09,826 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) [2022-04-27 12:19:09,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:19:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:09,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:19:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:09,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:10,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2022-04-27 12:19:10,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {975#true} is VALID [2022-04-27 12:19:10,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:19:10,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #103#return; {975#true} is VALID [2022-04-27 12:19:10,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret5 := main(); {975#true} is VALID [2022-04-27 12:19:10,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {975#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {975#true} is VALID [2022-04-27 12:19:10,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {975#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 100 then 1 else 0)); {975#true} is VALID [2022-04-27 12:19:10,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:19:10,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:19:10,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:19:10,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {975#true} {975#true} #81#return; {975#true} is VALID [2022-04-27 12:19:10,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {975#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {975#true} is VALID [2022-04-27 12:19:10,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:19:10,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:19:10,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:19:10,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {975#true} {975#true} #83#return; {975#true} is VALID [2022-04-27 12:19:10,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {975#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,228 INFO L272 TraceCheckUtils]: 20: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {975#true} is VALID [2022-04-27 12:19:10,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:19:10,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:19:10,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:19:10,229 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,229 INFO L272 TraceCheckUtils]: 25: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {975#true} is VALID [2022-04-27 12:19:10,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {975#true} ~cond := #in~cond; {975#true} is VALID [2022-04-27 12:19:10,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {975#true} assume !(0 == ~cond); {975#true} is VALID [2022-04-27 12:19:10,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {975#true} assume true; {975#true} is VALID [2022-04-27 12:19:10,232 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {975#true} {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:10,234 INFO L272 TraceCheckUtils]: 30: Hoare triple {1028#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:10,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {1071#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1075#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:10,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {1075#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {976#false} is VALID [2022-04-27 12:19:10,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {976#false} assume !false; {976#false} is VALID [2022-04-27 12:19:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:19:10,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:10,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326971797] [2022-04-27 12:19:10,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:10,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763335550] [2022-04-27 12:19:10,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763335550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:10,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:10,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284635146] [2022-04-27 12:19:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:19:10,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:10,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:10,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:10,269 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:15,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:16,944 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-27 12:19:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:16,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:19:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:19:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:19:16,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:19:17,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:17,117 INFO L225 Difference]: With dead ends: 74 [2022-04-27 12:19:17,117 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:19:17,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:17,118 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:17,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 12:19:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:19:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:19:17,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:17,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:19:17,155 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:19:17,156 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:19:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:17,161 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:19:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:19:17,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:17,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:17,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 12:19:17,163 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-27 12:19:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:17,170 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:19:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:19:17,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:17,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:17,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:17,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:19:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-27 12:19:17,174 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-27 12:19:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:17,178 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-27 12:19:17,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-27 12:19:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:19:17,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:17,179 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-27 12:19:17,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:17,386 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 [2022-04-27 12:19:17,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-27 12:19:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:17,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356599733] [2022-04-27 12:19:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:17,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:17,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516224938] [2022-04-27 12:19:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:17,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:17,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:17,432 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) [2022-04-27 12:19:17,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:19:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:17,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:17,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:17,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} call ULTIMATE.init(); {1376#true} is VALID [2022-04-27 12:19:17,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1376#true} is VALID [2022-04-27 12:19:17,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} #103#return; {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} call #t~ret5 := main(); {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {1376#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 100 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:19:17,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1376#true} {1376#true} #81#return; {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {1376#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:19:17,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:19:17,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#true} {1376#true} #83#return; {1376#true} is VALID [2022-04-27 12:19:17,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,805 INFO L272 TraceCheckUtils]: 22: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:19:17,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:19:17,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:19:17,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:19:17,807 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,807 INFO L272 TraceCheckUtils]: 27: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1376#true} is VALID [2022-04-27 12:19:17,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-04-27 12:19:17,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-04-27 12:19:17,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-04-27 12:19:17,816 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1376#true} {1429#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1429#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:17,817 INFO L272 TraceCheckUtils]: 32: Hoare triple {1429#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:17,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:17,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1377#false} is VALID [2022-04-27 12:19:17,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-04-27 12:19:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 12:19:17,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:17,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356599733] [2022-04-27 12:19:17,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:17,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516224938] [2022-04-27 12:19:17,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516224938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:17,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:17,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844146769] [2022-04-27 12:19:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:17,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:19:17,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:17,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:17,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:17,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:17,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:17,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:17,850 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:20,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:25,364 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-27 12:19:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:19:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:19:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:19:25,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 12:19:25,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:25,470 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:19:25,470 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 12:19:25,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:25,471 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:25,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 12:19:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 12:19:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 12:19:25,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:25,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:25,512 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:25,512 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:25,517 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 12:19:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:19:25,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:25,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:25,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 12:19:25,518 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-27 12:19:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:25,521 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 12:19:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:19:25,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:25,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:25,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:25,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-27 12:19:25,526 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-27 12:19:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:25,527 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-27 12:19:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:19:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-27 12:19:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 12:19:25,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:25,531 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:25,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:25,755 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 [2022-04-27 12:19:25,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-27 12:19:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:25,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817192197] [2022-04-27 12:19:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:25,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:25,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285931042] [2022-04-27 12:19:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:25,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:25,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:25,782 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) [2022-04-27 12:19:25,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process