/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/dijkstra-u_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 18:32:50,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 18:32:50,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 18:32:50,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 18:32:50,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 18:32:50,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 18:32:50,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 18:32:50,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 18:32:50,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 18:32:50,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 18:32:50,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 18:32:50,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 18:32:50,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 18:32:50,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 18:32:50,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 18:32:50,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 18:32:50,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 18:32:50,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 18:32:50,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 18:32:50,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 18:32:50,377 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 18:32:50,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 18:32:50,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 18:32:50,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 18:32:50,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 18:32:50,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 18:32:50,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 18:32:50,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 18:32:50,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 18:32:50,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 18:32:50,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 18:32:50,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 18:32:50,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 18:32:50,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 18:32:50,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 18:32:50,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 18:32:50,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 18:32:50,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 18:32:50,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 18:32:50,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 18:32:50,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 18:32:50,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 18:32:50,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 18:32:50,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 18:32:50,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 18:32:50,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 18:32:50,416 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 18:32:50,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 18:32:50,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 18:32:50,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 18:32:50,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 18:32:50,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 18:32:50,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 18:32:50,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 18:32:50,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 18:32:50,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:32:50,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 18:32:50,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 18:32:50,419 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 18:32:50,419 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 18:32:50,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 18:32:50,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 18:32:50,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 18:32:50,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 18:32:50,640 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 18:32:50,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-07 18:32:50,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3a18b3c/f8f47ef350814042b94c754fdb018dee/FLAGfbdb85c86 [2022-04-07 18:32:51,100 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 18:32:51,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c [2022-04-07 18:32:51,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3a18b3c/f8f47ef350814042b94c754fdb018dee/FLAGfbdb85c86 [2022-04-07 18:32:51,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3a18b3c/f8f47ef350814042b94c754fdb018dee [2022-04-07 18:32:51,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 18:32:51,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 18:32:51,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 18:32:51,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 18:32:51,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 18:32:51,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6714f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51, skipping insertion in model container [2022-04-07 18:32:51,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 18:32:51,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 18:32:51,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2022-04-07 18:32:51,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:32:51,695 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 18:32:51,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2022-04-07 18:32:51,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:32:51,730 INFO L208 MainTranslator]: Completed translation [2022-04-07 18:32:51,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51 WrapperNode [2022-04-07 18:32:51,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 18:32:51,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 18:32:51,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 18:32:51,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 18:32:51,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 18:32:51,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 18:32:51,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 18:32:51,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 18:32:51,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (1/1) ... [2022-04-07 18:32:51,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:32:51,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:32:51,812 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 18:32:51,826 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 18:32:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 18:32:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 18:32:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 18:32:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 18:32:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 18:32:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 18:32:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 18:32:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 18:32:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 18:32:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 18:32:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 18:32:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 18:32:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 18:32:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 18:32:51,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 18:32:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 18:32:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 18:32:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 18:32:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 18:32:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 18:32:51,917 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 18:32:51,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 18:32:52,188 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 18:32:52,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 18:32:52,201 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 18:32:52,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:52 BoogieIcfgContainer [2022-04-07 18:32:52,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 18:32:52,204 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 18:32:52,204 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 18:32:52,205 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 18:32:52,207 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:52" (1/1) ... [2022-04-07 18:32:52,209 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 18:32:52,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:32:52 BasicIcfg [2022-04-07 18:32:52,260 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 18:32:52,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 18:32:52,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 18:32:52,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 18:32:52,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 06:32:51" (1/4) ... [2022-04-07 18:32:52,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef9daac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:32:52, skipping insertion in model container [2022-04-07 18:32:52,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:51" (2/4) ... [2022-04-07 18:32:52,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef9daac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:32:52, skipping insertion in model container [2022-04-07 18:32:52,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:52" (3/4) ... [2022-04-07 18:32:52,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef9daac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:32:52, skipping insertion in model container [2022-04-07 18:32:52,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:32:52" (4/4) ... [2022-04-07 18:32:52,270 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.cJordan [2022-04-07 18:32:52,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 18:32:52,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 18:32:52,319 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 18:32:52,326 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 18:32:52,327 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 18:32:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:32:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 18:32:52,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:52,355 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:52,355 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times [2022-04-07 18:32:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:52,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190899335] [2022-04-07 18:32:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:32:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:52,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 18:32:52,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:32:52,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:32:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:32:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:52,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-07 18:32:52,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:32:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 18:32:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:52,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-07 18:32:52,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:32:52,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:32:52,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 18:32:52,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:32:52,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:32:52,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 18:32:52,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-07 18:32:52,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 18:32:52,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-07 18:32:52,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:32:52,602 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 18:32:52,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-07 18:32:52,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,604 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 18:32:52,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-07 18:32:52,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} [118] L30-2-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} [122] L52-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} [127] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_24 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0) (* (* v_main_~n~0_24 .cse0) 4294967295))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_24, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-07 18:32:52,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [130] __VERIFIER_assertENTRY-->L12: 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] {42#false} is VALID [2022-04-07 18:32:52,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} [133] L12-->L13: 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[] {42#false} is VALID [2022-04-07 18:32:52,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 18:32:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 18:32:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190899335] [2022-04-07 18:32:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190899335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:52,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 18:32:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094359939] [2022-04-07 18:32:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:32:52,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:52,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:32:52,657 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 18:32:52,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 18:32:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 18:32:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:32:52,687 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:32:55,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 18:32:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:55,188 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-07 18:32:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 18:32:55,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:32:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:32:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:32:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-07 18:32:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:32:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-07 18:32:55,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-07 18:32:55,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:55,296 INFO L225 Difference]: With dead ends: 38 [2022-04-07 18:32:55,296 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 18:32:55,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:32:55,299 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:32:55,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 18:32:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 18:32:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 18:32:55,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:32:55,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:32:55,326 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:32:55,327 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:32:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:55,333 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-07 18:32:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-07 18:32:55,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:55,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:55,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-07 18:32:55,335 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-07 18:32:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:55,340 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-07 18:32:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-07 18:32:55,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:55,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:55,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:32:55,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:32:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:32:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-07 18:32:55,346 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-07 18:32:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:32:55,347 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-07 18:32:55,347 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:32:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-07 18:32:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 18:32:55,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:55,348 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:55,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 18:32:55,349 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times [2022-04-07 18:32:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:55,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017511315] [2022-04-07 18:32:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:32:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:55,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {194#true} is VALID [2022-04-07 18:32:55,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:32:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:55,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: 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] {194#true} is VALID [2022-04-07 18:32:55,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-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[] {194#true} is VALID [2022-04-07 18:32:55,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 18:32:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:55,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: 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] {194#true} is VALID [2022-04-07 18:32:55,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-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[] {194#true} is VALID [2022-04-07 18:32:55,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:32:55,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {194#true} is VALID [2022-04-07 18:32:55,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {194#true} is VALID [2022-04-07 18:32:55,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {194#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: 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] {194#true} is VALID [2022-04-07 18:32:55,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {194#true} [117] L9-->L9-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[] {194#true} is VALID [2022-04-07 18:32:55,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {194#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: 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] {194#true} is VALID [2022-04-07 18:32:55,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {194#true} [117] L9-->L9-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[] {194#true} is VALID [2022-04-07 18:32:55,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#true} is VALID [2022-04-07 18:32:55,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID [2022-04-07 18:32:55,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {194#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 18:32:55,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 18:32:55,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 18:32:55,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 18:32:55,666 INFO L272 TraceCheckUtils]: 20: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 18:32:55,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 18:32:55,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {195#false} is VALID [2022-04-07 18:32:55,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {195#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#false} is VALID [2022-04-07 18:32:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 18:32:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:55,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017511315] [2022-04-07 18:32:55,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017511315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:55,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 18:32:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696942038] [2022-04-07 18:32:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 18:32:55,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:55,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:32:55,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:55,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 18:32:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 18:32:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 18:32:55,690 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:32:59,582 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 18:33:01,585 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 18:33:04,388 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 18:33:09,467 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 18:33:11,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 18:33:13,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 18:33:15,893 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 18:33:17,896 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 18:33:20,047 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 18:33:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:24,215 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-04-07 18:33:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 18:33:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 18:33:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-07 18:33:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-07 18:33:24,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-07 18:33:24,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:24,419 INFO L225 Difference]: With dead ends: 44 [2022-04-07 18:33:24,419 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 18:33:24,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 18:33:24,421 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 26 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:24,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 53 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 22.5s Time] [2022-04-07 18:33:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 18:33:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-07 18:33:24,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:24,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:33:24,427 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:33:24,428 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:33:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:24,432 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-04-07 18:33:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-07 18:33:24,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:24,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:24,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 44 states. [2022-04-07 18:33:24,433 INFO L87 Difference]: Start difference. First operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 44 states. [2022-04-07 18:33:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:24,437 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-04-07 18:33:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-07 18:33:24,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:24,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:24,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:24,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:33:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-04-07 18:33:24,442 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 24 [2022-04-07 18:33:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:24,442 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-04-07 18:33:24,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-04-07 18:33:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 18:33:24,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:24,443 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:24,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 18:33:24,444 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times [2022-04-07 18:33:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:24,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425929938] [2022-04-07 18:33:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:33:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:24,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-07 18:33:24,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:33:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:24,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [114] assume_abort_if_notENTRY-->L9: 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] {398#true} is VALID [2022-04-07 18:33:24,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [117] L9-->L9-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[] {398#true} is VALID [2022-04-07 18:33:24,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 18:33:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:24,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [114] assume_abort_if_notENTRY-->L9: 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] {398#true} is VALID [2022-04-07 18:33:24,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [117] L9-->L9-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[] {398#true} is VALID [2022-04-07 18:33:24,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:33:24,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {398#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#true} [114] assume_abort_if_notENTRY-->L9: 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] {398#true} is VALID [2022-04-07 18:33:24,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#true} [117] L9-->L9-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[] {398#true} is VALID [2022-04-07 18:33:24,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {398#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#true} [114] assume_abort_if_notENTRY-->L9: 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] {398#true} is VALID [2022-04-07 18:33:24,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#true} [117] L9-->L9-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[] {398#true} is VALID [2022-04-07 18:33:24,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {398#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 18:33:24,669 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {398#true} {398#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 18:33:24,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {398#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:24,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:24,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:24,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:24,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {411#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {412#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 18:33:24,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {412#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {412#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 18:33:24,679 INFO L272 TraceCheckUtils]: 22: Hoare triple {412#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {413#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 18:33:24,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {414#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 18:33:24,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {399#false} is VALID [2022-04-07 18:33:24,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {399#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-07 18:33:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 18:33:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:24,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425929938] [2022-04-07 18:33:24,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425929938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:24,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:24,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 18:33:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702268788] [2022-04-07 18:33:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-07 18:33:24,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:24,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:24,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:24,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 18:33:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 18:33:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 18:33:24,711 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:34,995 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 18:33:38,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 18:33:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:39,270 INFO L93 Difference]: Finished difference Result 68 states and 99 transitions. [2022-04-07 18:33:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 18:33:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-07 18:33:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-07 18:33:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-07 18:33:39,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-07 18:33:39,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:39,636 INFO L225 Difference]: With dead ends: 68 [2022-04-07 18:33:39,636 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 18:33:39,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 18:33:39,638 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 79 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:39,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 49 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 222 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-04-07 18:33:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 18:33:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-07 18:33:39,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:39,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:33:39,647 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:33:39,647 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:33:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:39,652 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-07 18:33:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-07 18:33:39,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:39,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:39,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 66 states. [2022-04-07 18:33:39,655 INFO L87 Difference]: Start difference. First operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 66 states. [2022-04-07 18:33:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:39,660 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-07 18:33:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-07 18:33:39,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:39,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:39,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:39,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:33:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2022-04-07 18:33:39,666 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 26 [2022-04-07 18:33:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:39,667 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2022-04-07 18:33:39,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 18:33:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-07 18:33:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 18:33:39,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:39,668 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:39,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 18:33:39,668 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times [2022-04-07 18:33:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:39,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397726175] [2022-04-07 18:33:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:39,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452609947] [2022-04-07 18:33:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:39,691 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 18:33:39,694 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 18:33:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:39,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 18:33:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:39,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:33:39,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {692#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#true} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {692#true} is VALID [2022-04-07 18:33:39,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {692#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {692#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {692#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {692#true} is VALID [2022-04-07 18:33:39,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {692#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {692#true} is VALID [2022-04-07 18:33:39,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {692#true} [114] assume_abort_if_notENTRY-->L9: 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] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {692#true} [117] L9-->L9-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[] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {692#true} {692#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L272 TraceCheckUtils]: 11: Hoare triple {692#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {692#true} [114] assume_abort_if_notENTRY-->L9: 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] {692#true} is VALID [2022-04-07 18:33:39,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {692#true} [117] L9-->L9-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[] {692#true} is VALID [2022-04-07 18:33:39,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {692#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,980 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {692#true} {692#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {692#true} is VALID [2022-04-07 18:33:39,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {692#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,982 INFO L272 TraceCheckUtils]: 20: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {692#true} is VALID [2022-04-07 18:33:39,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {692#true} [130] __VERIFIER_assertENTRY-->L12: 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] {692#true} is VALID [2022-04-07 18:33:39,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {692#true} [134] L12-->L12-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[] {692#true} is VALID [2022-04-07 18:33:39,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {692#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,984 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {692#true} {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,984 INFO L272 TraceCheckUtils]: 25: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {692#true} is VALID [2022-04-07 18:33:39,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {692#true} [130] __VERIFIER_assertENTRY-->L12: 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] {692#true} is VALID [2022-04-07 18:33:39,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {692#true} [134] L12-->L12-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[] {692#true} is VALID [2022-04-07 18:33:39,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {692#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID [2022-04-07 18:33:39,985 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {692#true} {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 18:33:39,987 INFO L272 TraceCheckUtils]: 30: Hoare triple {745#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:33:39,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {788#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:33:39,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {792#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {693#false} is VALID [2022-04-07 18:33:39,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {693#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#false} is VALID [2022-04-07 18:33:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-07 18:33:39,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:33:39,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397726175] [2022-04-07 18:33:39,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:33:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452609947] [2022-04-07 18:33:39,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452609947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:39,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:39,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:33:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662972454] [2022-04-07 18:33:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 18:33:39,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:39,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:40,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:40,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:33:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:33:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:33:40,030 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:42,605 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-04-07 18:33:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:33:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 18:33:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 18:33:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 18:33:42,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 18:33:42,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:42,685 INFO L225 Difference]: With dead ends: 78 [2022-04-07 18:33:42,685 INFO L226 Difference]: Without dead ends: 57 [2022-04-07 18:33:42,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:33:42,686 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:42,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 18:33:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-07 18:33:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-07 18:33:42,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:42,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:42,692 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:42,693 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:42,696 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-07 18:33:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-07 18:33:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-07 18:33:42,698 INFO L87 Difference]: Start difference. First operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 57 states. [2022-04-07 18:33:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:42,701 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-04-07 18:33:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-07 18:33:42,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:42,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:42,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:42,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 26 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2022-04-07 18:33:42,705 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 34 [2022-04-07 18:33:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:42,706 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-04-07 18:33:42,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-04-07 18:33:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 18:33:42,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:42,707 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:42,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 18:33:42,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:42,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times [2022-04-07 18:33:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192197637] [2022-04-07 18:33:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:42,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:42,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435269858] [2022-04-07 18:33:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:42,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:42,953 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 18:33:42,974 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 18:33:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:43,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:33:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:43,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:33:43,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {1049#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#true} [108] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1049#true} is VALID [2022-04-07 18:33:43,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1049#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1049#true} {1049#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1049#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1049#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {1049#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#true} [114] assume_abort_if_notENTRY-->L9: 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] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1049#true} [117] L9-->L9-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[] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1049#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1049#true} {1049#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 10) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1049#true} is VALID [2022-04-07 18:33:43,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1049#true} [114] assume_abort_if_notENTRY-->L9: 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] {1049#true} is VALID [2022-04-07 18:33:43,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#true} [117] L9-->L9-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[] {1049#true} is VALID [2022-04-07 18:33:43,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1049#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,267 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1049#true} {1049#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1049#true} is VALID [2022-04-07 18:33:43,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1049#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,270 INFO L272 TraceCheckUtils]: 22: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1049#true} is VALID [2022-04-07 18:33:43,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {1049#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1049#true} is VALID [2022-04-07 18:33:43,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {1049#true} [134] L12-->L12-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[] {1049#true} is VALID [2022-04-07 18:33:43,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {1049#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,271 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1049#true} {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,271 INFO L272 TraceCheckUtils]: 27: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1049#true} is VALID [2022-04-07 18:33:43,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {1049#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1049#true} is VALID [2022-04-07 18:33:43,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {1049#true} [134] L12-->L12-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[] {1049#true} is VALID [2022-04-07 18:33:43,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {1049#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 18:33:43,272 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1049#true} {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1102#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:43,273 INFO L272 TraceCheckUtils]: 32: Hoare triple {1102#(and (= main_~p~0 0) (= main_~h~0 0))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1151#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:33:43,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {1151#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {1155#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:33:43,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {1155#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {1050#false} is VALID [2022-04-07 18:33:43,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {1050#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 18:33:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-07 18:33:43,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:33:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192197637] [2022-04-07 18:33:43,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:33:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435269858] [2022-04-07 18:33:43,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435269858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:43,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:33:43,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479380738] [2022-04-07 18:33:43,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 18:33:43,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:43,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:43,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:43,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:33:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:33:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:33:43,307 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:46,058 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-04-07 18:33:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:33:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 18:33:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 18:33:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 18:33:46,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 18:33:46,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:46,132 INFO L225 Difference]: With dead ends: 65 [2022-04-07 18:33:46,132 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 18:33:46,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:33:46,133 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:46,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 18:33:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 18:33:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-07 18:33:46,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:46,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:46,140 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:46,140 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:46,143 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-04-07 18:33:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-04-07 18:33:46,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:46,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:46,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 64 states. [2022-04-07 18:33:46,145 INFO L87 Difference]: Start difference. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 64 states. [2022-04-07 18:33:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:46,148 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-04-07 18:33:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-04-07 18:33:46,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:46,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:46,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:46,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 18:33:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-04-07 18:33:46,151 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 36 [2022-04-07 18:33:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:46,152 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-04-07 18:33:46,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 18:33:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-04-07 18:33:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 18:33:46,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:46,153 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:46,179 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 18:33:46,375 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 18:33:46,375 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times [2022-04-07 18:33:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901397662] [2022-04-07 18:33:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:46,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:46,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012078389] [2022-04-07 18:33:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:46,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:46,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:46,409 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 18:33:46,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process