/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:43:22,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:43:22,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:43:22,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:43:22,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:43:22,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:43:22,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:43:22,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:43:22,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:43:22,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:43:22,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:43:22,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:43:22,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:43:22,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:43:22,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:43:22,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:43:22,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:43:22,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:43:22,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:43:22,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:43:22,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:43:22,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:43:22,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:43:22,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:43:22,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:43:22,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:43:22,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:43:22,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:43:22,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:43:22,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:43:22,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:43:22,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:43:22,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:43:22,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:43:22,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:43:22,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:43:22,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:43:22,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:43:22,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:43:22,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:43:22,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:43:22,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:43:22,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:43:22,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:43:22,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:43:22,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:43:22,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:43:22,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:43:22,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:43:22,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:43:22,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:43:22,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:43:22,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:43:22,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:43:22,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:43:22,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:43:22,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:43:22,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:43:22,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:43:22,579 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-07 19:43:22,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:43:22,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:43:22,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:43:22,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:43:22,809 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:43:22,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-07 19:43:22,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc6fe9d1/6c621d3c19074610aa53007e32b1445e/FLAGc7f6946ca [2022-04-07 19:43:23,233 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:43:23,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-07 19:43:23,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc6fe9d1/6c621d3c19074610aa53007e32b1445e/FLAGc7f6946ca [2022-04-07 19:43:23,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc6fe9d1/6c621d3c19074610aa53007e32b1445e [2022-04-07 19:43:23,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:43:23,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:43:23,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:43:23,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:43:23,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:43:23,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4ee9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23, skipping insertion in model container [2022-04-07 19:43:23,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:43:23,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:43:23,485 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/hard-u_unwindbound1.c[537,550] [2022-04-07 19:43:23,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:43:23,511 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:43:23,521 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/hard-u_unwindbound1.c[537,550] [2022-04-07 19:43:23,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:43:23,541 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:43:23,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23 WrapperNode [2022-04-07 19:43:23,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:43:23,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:43:23,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:43:23,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:43:23,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:43:23,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:43:23,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:43:23,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:43:23,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:43:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:43:23,608 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-07 19:43:23,613 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-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:43:23,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:43:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:43:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:43:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:43:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:43:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:43:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:43:23,687 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:43:23,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:43:23,836 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:43:23,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:43:23,842 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 19:43:23,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:43:23 BoogieIcfgContainer [2022-04-07 19:43:23,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:43:23,845 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:43:23,845 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:43:23,846 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:43:23,848 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:43:23" (1/1) ... [2022-04-07 19:43:23,850 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:43:23,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:43:23 BasicIcfg [2022-04-07 19:43:23,879 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:43:23,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:43:23,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:43:23,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:43:23,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:43:23" (1/4) ... [2022-04-07 19:43:23,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864d739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:43:23, skipping insertion in model container [2022-04-07 19:43:23,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:43:23" (2/4) ... [2022-04-07 19:43:23,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864d739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:43:23, skipping insertion in model container [2022-04-07 19:43:23,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:43:23" (3/4) ... [2022-04-07 19:43:23,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864d739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:43:23, skipping insertion in model container [2022-04-07 19:43:23,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:43:23" (4/4) ... [2022-04-07 19:43:23,886 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound1.cJordan [2022-04-07 19:43:23,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:43:23,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:43:23,926 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:43:23,932 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-07 19:43:23,933 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:43:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:43:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 19:43:23,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:23,997 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:43:23,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash 79654685, now seen corresponding path program 1 times [2022-04-07 19:43:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:24,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334883262] [2022-04-07 19:43:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:43:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-07 19:43:24,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:43:24,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:43:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:43:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-07 19:43:24,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:43:24,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:43:24,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-07 19:43:24,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:43:24,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:43:24,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:43:24,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {40#true} is VALID [2022-04-07 19:43:24,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-07 19:43:24,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-07 19:43:24,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:43:24,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {41#false} is VALID [2022-04-07 19:43:24,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [108] L35-3-->L53-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [112] L53-2-->L45-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,295 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {41#false} is VALID [2022-04-07 19:43:24,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-07 19:43:24,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:43:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:43:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334883262] [2022-04-07 19:43:24,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334883262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:24,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:24,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:43:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721071730] [2022-04-07 19:43:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:24,310 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 19:43:24,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:24,314 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:24,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:43:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:43:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:43:24,379 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:24,585 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 19:43:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:43:24,585 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 19:43:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:24,587 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 19:43:24,601 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-07 19:43:24,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-07 19:43:24,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:24,680 INFO L225 Difference]: With dead ends: 38 [2022-04-07 19:43:24,680 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 19:43:24,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-07 19:43:24,689 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:24,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:43:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 19:43:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-07 19:43:24,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:24,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:24,720 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:24,722 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:24,734 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-07 19:43:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-07 19:43:24,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:24,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:24,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-07 19:43:24,741 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-07 19:43:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:24,752 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-07 19:43:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-07 19:43:24,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:24,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:24,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:24,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 19:43:24,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-07 19:43:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:24,758 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 19:43:24,758 INFO L479 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 19:43:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 19:43:24,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:24,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:43:24,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:43:24,760 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash -85369733, now seen corresponding path program 1 times [2022-04-07 19:43:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:24,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630935233] [2022-04-07 19:43:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:24,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:43:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-07 19:43:24,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:43:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:24,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-07 19:43:24,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-07 19:43:24,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {188#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:43:24,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-07 19:43:24,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {188#true} is VALID [2022-04-07 19:43:24,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {188#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-07 19:43:24,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-07 19:43:24,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-07 19:43:24,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-07 19:43:24,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {197#(= main_~q~0 0)} is VALID [2022-04-07 19:43:24,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#(= main_~q~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-07 19:43:24,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#(= main_~q~0 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-07 19:43:24,874 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#(= main_~q~0 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:43:24,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:43:24,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-07 19:43:24,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {189#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-07 19:43:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:43:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:24,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630935233] [2022-04-07 19:43:24,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630935233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:24,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:24,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:43:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339453710] [2022-04-07 19:43:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:24,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 19:43:24,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:24,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:24,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:24,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:43:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:43:24,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:43:24,895 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,340 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-07 19:43:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 19:43:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 19:43:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-07 19:43:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-07 19:43:25,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-07 19:43:25,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:25,445 INFO L225 Difference]: With dead ends: 45 [2022-04-07 19:43:25,445 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 19:43:25,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:43:25,447 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:25,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:43:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 19:43:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-07 19:43:25,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:25,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,458 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,458 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,461 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-07 19:43:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-07 19:43:25,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:25,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:25,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-07 19:43:25,463 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-07 19:43:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,466 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-07 19:43:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-07 19:43:25,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:25,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:25,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:25,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-07 19:43:25,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-07 19:43:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:25,486 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-07 19:43:25,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 19:43:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-07 19:43:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 19:43:25,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:25,489 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:43:25,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 19:43:25,490 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1527809342, now seen corresponding path program 1 times [2022-04-07 19:43:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216004244] [2022-04-07 19:43:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:25,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:25,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:43:25,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969564738] [2022-04-07 19:43:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:43:25,511 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-07 19:43:25,525 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-07 19:43:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:25,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:43:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:25,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:43:25,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {382#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#true} is VALID [2022-04-07 19:43:25,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#(<= ~counter~0 0)} {382#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {390#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {390#(<= ~counter~0 0)} {390#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-07 19:43:25,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {390#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {424#(<= |main_#t~post6| 0)} is VALID [2022-04-07 19:43:25,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(<= |main_#t~post6| 0)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {383#false} is VALID [2022-04-07 19:43:25,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {383#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {383#false} is VALID [2022-04-07 19:43:25,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {383#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {383#false} is VALID [2022-04-07 19:43:25,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {383#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {383#false} is VALID [2022-04-07 19:43:25,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {383#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {383#false} is VALID [2022-04-07 19:43:25,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {383#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-07 19:43:25,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {383#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-07 19:43:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:43:25,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:43:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:25,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216004244] [2022-04-07 19:43:25,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:43:25,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969564738] [2022-04-07 19:43:25,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969564738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:25,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:25,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:43:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861387545] [2022-04-07 19:43:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 19:43:25,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:25,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:43:25,778 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-07 19:43:25,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 19:43:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 19:43:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:43:25,779 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:43:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,879 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 19:43:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 19:43:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 19:43:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:43:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 19:43:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:43:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 19:43:25,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-07 19:43:25,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:25,938 INFO L225 Difference]: With dead ends: 38 [2022-04-07 19:43:25,939 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 19:43:25,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:43:25,940 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:25,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:43:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 19:43:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-07 19:43:25,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:25,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,944 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,945 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,947 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 19:43:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-07 19:43:25,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:25,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:25,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-07 19:43:25,948 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-07 19:43:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:25,950 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 19:43:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-07 19:43:25,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:25,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:25,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:25,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-07 19:43:25,953 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-07 19:43:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:25,953 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-07 19:43:25,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 19:43:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-07 19:43:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 19:43:25,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:25,955 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:43:25,984 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-07 19:43:26,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:26,168 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2128444854, now seen corresponding path program 1 times [2022-04-07 19:43:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:26,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145705768] [2022-04-07 19:43:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:43:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-07 19:43:26,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:43:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-07 19:43:26,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-07 19:43:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 19:43:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-07 19:43:26,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-07 19:43:26,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:43:26,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-07 19:43:26,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {597#true} is VALID [2022-04-07 19:43:26,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-07 19:43:26,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-07 19:43:26,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-07 19:43:26,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-07 19:43:26,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-07 19:43:26,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-07 19:43:26,290 INFO L272 TraceCheckUtils]: 14: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {597#true} is VALID [2022-04-07 19:43:26,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-07 19:43:26,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-07 19:43:26,292 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {597#true} {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-07 19:43:26,293 INFO L272 TraceCheckUtils]: 19: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:43:26,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:43:26,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {612#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-07 19:43:26,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {598#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-07 19:43:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 19:43:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:26,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145705768] [2022-04-07 19:43:26,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145705768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:26,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:26,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:43:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405041117] [2022-04-07 19:43:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:26,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:43:26,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:26,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:43:26,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:26,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:43:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:26,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:43:26,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:43:26,316 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:43:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:26,761 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 19:43:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 19:43:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:43:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:43:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-07 19:43:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:43:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-07 19:43:26,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-07 19:43:26,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:26,841 INFO L225 Difference]: With dead ends: 50 [2022-04-07 19:43:26,841 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 19:43:26,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:43:26,842 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:26,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:43:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 19:43:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-07 19:43:26,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:26,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:26,856 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:26,856 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:26,863 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 19:43:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 19:43:26,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:26,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:26,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-07 19:43:26,868 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-07 19:43:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:26,872 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-07 19:43:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-07 19:43:26,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:26,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:26,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:43:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-07 19:43:26,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-07 19:43:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:26,879 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-07 19:43:26,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:43:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-07 19:43:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 19:43:26,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:26,880 INFO L499 BasicCegarLoop]: trace histogram [3, 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-07 19:43:26,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 19:43:26,880 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 135546551, now seen corresponding path program 1 times [2022-04-07 19:43:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:26,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377017574] [2022-04-07 19:43:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:26,915 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:43:26,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190530623] [2022-04-07 19:43:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:43:26,928 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-07 19:43:26,958 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-07 19:43:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:43:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:26,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:43:27,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {816#true} is VALID [2022-04-07 19:43:27,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {816#true} is VALID [2022-04-07 19:43:27,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-07 19:43:27,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {816#true} is VALID [2022-04-07 19:43:27,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {816#true} {816#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-07 19:43:27,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:43:27,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:43:27,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:43:27,118 INFO L272 TraceCheckUtils]: 14: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {816#true} is VALID [2022-04-07 19:43:27,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-07 19:43:27,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,119 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {816#true} {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:43:27,120 INFO L272 TraceCheckUtils]: 19: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {816#true} is VALID [2022-04-07 19:43:27,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-07 19:43:27,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-07 19:43:27,121 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {816#true} {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:43:27,122 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:43:27,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:43:27,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-07 19:43:27,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {817#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-07 19:43:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:43:27,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:43:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377017574] [2022-04-07 19:43:27,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:43:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190530623] [2022-04-07 19:43:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190530623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:27,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:27,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:43:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869838909] [2022-04-07 19:43:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 19:43:27,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:27,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:43:27,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:27,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:43:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:43:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:43:27,147 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:43:29,341 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-07 19:43:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:29,547 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-07 19:43:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:43:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 19:43:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:43:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 19:43:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:43:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 19:43:29,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-07 19:43:29,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:29,627 INFO L225 Difference]: With dead ends: 57 [2022-04-07 19:43:29,627 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 19:43:29,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-07 19:43:29,628 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:29,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 19:43:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 19:43:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-07 19:43:29,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:29,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:43:29,633 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:43:29,633 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:43:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:29,636 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-07 19:43:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-07 19:43:29,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:29,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:29,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-07 19:43:29,637 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-07 19:43:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:29,639 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-07 19:43:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-07 19:43:29,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:29,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:29,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:29,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:43:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-07 19:43:29,642 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-07 19:43:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:29,643 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-07 19:43:29,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:43:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-07 19:43:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:43:29,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:29,644 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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-07 19:43:29,675 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-07 19:43:29,859 WARN L460 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-07 19:43:29,860 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025214, now seen corresponding path program 1 times [2022-04-07 19:43:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:29,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693538979] [2022-04-07 19:43:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:29,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:43:29,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157106629] [2022-04-07 19:43:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:29,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:43:29,883 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-07 19:43:29,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 19:43:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:29,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 19:43:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:43:29,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:43:30,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1131#true} is VALID [2022-04-07 19:43:30,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1131#true} is VALID [2022-04-07 19:43:30,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,722 INFO L272 TraceCheckUtils]: 14: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1131#true} is VALID [2022-04-07 19:43:30,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-07 19:43:30,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,728 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1131#true} {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1131#true} is VALID [2022-04-07 19:43:30,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-07 19:43:30,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,732 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1131#true} {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,732 INFO L272 TraceCheckUtils]: 24: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1131#true} is VALID [2022-04-07 19:43:30,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-07 19:43:30,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-07 19:43:30,734 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1131#true} {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {1169#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:43:30,754 INFO L272 TraceCheckUtils]: 32: Hoare triple {1224#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:43:30,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {1234#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:43:30,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {1238#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-07 19:43:30,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {1132#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-07 19:43:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:43:30,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:43:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:43:30,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693538979] [2022-04-07 19:43:30,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:43:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157106629] [2022-04-07 19:43:30,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157106629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:43:30,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:43:30,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:43:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557043524] [2022-04-07 19:43:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:43:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:30,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:43:30,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:30,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:30,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:43:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:43:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:43:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:43:30,802 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:31,338 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2022-04-07 19:43:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:43:31,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:43:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-07 19:43:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-07 19:43:31,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-07 19:43:31,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:43:31,422 INFO L225 Difference]: With dead ends: 75 [2022-04-07 19:43:31,422 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 19:43:31,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 19:43:31,423 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:43:31,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:43:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 19:43:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-04-07 19:43:31,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:43:31,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 19:43:31,429 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 19:43:31,429 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 19:43:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:31,432 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-07 19:43:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-07 19:43:31,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:31,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:31,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-07 19:43:31,433 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-07 19:43:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:43:31,436 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-07 19:43:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-07 19:43:31,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:43:31,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:43:31,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:43:31,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:43:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 19:43:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-04-07 19:43:31,440 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 36 [2022-04-07 19:43:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:43:31,440 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-04-07 19:43:31,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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-07 19:43:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-07 19:43:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:43:31,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:43:31,441 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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-07 19:43:31,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 19:43:31,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:31,666 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:43:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:43:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash 66401941, now seen corresponding path program 1 times [2022-04-07 19:43:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:43:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705147576] [2022-04-07 19:43:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:43:31,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:43:31,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427639834] [2022-04-07 19:43:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:43:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:31,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:43:31,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:43:31,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 19:43:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:43:31,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:43:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:43:31,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:43:31,776 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:43:31,777 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:43:31,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 19:43:31,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:43:32,002 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:43:32,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:43:32,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:43:32 BasicIcfg [2022-04-07 19:43:32,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:43:32,044 INFO L158 Benchmark]: Toolchain (without parser) took 8793.28ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 119.1MB in the beginning and 134.0MB in the end (delta: -14.9MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,045 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:43:32,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.10ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 146.0MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,045 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 167.8MB. Free memory was 146.0MB in the beginning and 144.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,045 INFO L158 Benchmark]: RCFGBuilder took 271.60ms. Allocated memory is still 167.8MB. Free memory was 144.7MB in the beginning and 132.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,045 INFO L158 Benchmark]: IcfgTransformer took 34.04ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,046 INFO L158 Benchmark]: TraceAbstraction took 8163.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.0MB in the beginning and 134.0MB in the end (delta: -4.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-07 19:43:32,052 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.10ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 146.0MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 167.8MB. Free memory was 146.0MB in the beginning and 144.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.60ms. Allocated memory is still 167.8MB. Free memory was 144.7MB in the beginning and 132.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 34.04ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8163.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.0MB in the beginning and 134.0MB in the end (delta: -4.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] unsigned int A, B; [L25] unsigned int r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L12] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0] [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0, d=4294967297, p=1, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, counter++=0, d=4294967297, p=1, q=0, r=4294967297] [L35] COND TRUE counter++<1 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=8589934594, p=2, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=2, counter++=1, d=8589934594, p=2, q=0, r=4294967297] [L35] COND FALSE !(counter++<1) [L45] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, counter++=2, d=8589934594, p=2, q=0, r=4294967297] [L45] COND FALSE !(counter++<1) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, d=8589934594, p=2, q=0, r=4294967297] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 244 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 4 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 19:43:32,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...