/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/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:10:45,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:10:46,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:10:46,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:10:46,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:10:46,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:10:46,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:10:46,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:10:46,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:10:46,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:10:46,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:10:46,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:10:46,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:10:46,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:10:46,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:10:46,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:10:46,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:10:46,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:10:46,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:10:46,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:10:46,077 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:10:46,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:10:46,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:10:46,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:10:46,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:10:46,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:10:46,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:10:46,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:10:46,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:10:46,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:10:46,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:10:46,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:10:46,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:10:46,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:10:46,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:10:46,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:10:46,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:10:46,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:10:46,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:10:46,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:10:46,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:10:46,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:10:46,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:10:46,098 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:10:46,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:10:46,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:10:46,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:10:46,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:10:46,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:10:46,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:10:46,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:46,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:10:46,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:10:46,101 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:10:46,102 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-27 16:10:46,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:10:46,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:10:46,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:10:46,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:10:46,343 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:10:46,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 16:10:46,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffded0c6b/16bb1ab051c34d4dbedb59ebac862e4b/FLAG1f4147321 [2022-04-27 16:10:46,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:10:46,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 16:10:46,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffded0c6b/16bb1ab051c34d4dbedb59ebac862e4b/FLAG1f4147321 [2022-04-27 16:10:47,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffded0c6b/16bb1ab051c34d4dbedb59ebac862e4b [2022-04-27 16:10:47,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:10:47,136 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:10:47,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:47,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:10:47,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:10:47,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bcb2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47, skipping insertion in model container [2022-04-27 16:10:47,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:10:47,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:10:47,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 16:10:47,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:47,316 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:10:47,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 16:10:47,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:47,350 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:10:47,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47 WrapperNode [2022-04-27 16:10:47,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:47,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:10:47,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:10:47,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:10:47,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:10:47,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:10:47,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:10:47,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:10:47,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:10:47,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:10:47,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:10:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:10:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:10:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:10:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:10:47,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:10:47,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:10:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:10:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:10:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:10:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:10:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:10:47,501 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:10:47,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:10:47,698 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:10:47,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:10:47,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:10:47,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:47 BoogieIcfgContainer [2022-04-27 16:10:47,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:10:47,705 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:10:47,705 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:10:47,720 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:10:47,722 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:47" (1/1) ... [2022-04-27 16:10:47,724 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:10:47,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:47 BasicIcfg [2022-04-27 16:10:47,741 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:10:47,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:10:47,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:10:47,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:10:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:10:47" (1/4) ... [2022-04-27 16:10:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5df068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:47, skipping insertion in model container [2022-04-27 16:10:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:47" (2/4) ... [2022-04-27 16:10:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5df068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:47, skipping insertion in model container [2022-04-27 16:10:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:47" (3/4) ... [2022-04-27 16:10:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5df068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:10:47, skipping insertion in model container [2022-04-27 16:10:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:47" (4/4) ... [2022-04-27 16:10:47,747 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.cJordan [2022-04-27 16:10:47,757 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:10:47,757 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:10:47,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:10:47,810 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f7c1edb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7aa5531b [2022-04-27 16:10:47,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:10:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:10:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:10:47,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:47,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:47,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -935980469, now seen corresponding path program 1 times [2022-04-27 16:10:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:47,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562037360] [2022-04-27 16:10:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {31#true} is VALID [2022-04-27 16:10:48,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:10:48,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:10:48,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:10:48,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {31#true} is VALID [2022-04-27 16:10:48,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:10:48,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:10:48,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:10:48,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {31#true} is VALID [2022-04-27 16:10:48,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} [105] L45-1-->L17-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:10:48,012 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {32#false} is VALID [2022-04-27 16:10:48,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} [112] __VERIFIER_assertENTRY-->L7: 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] {32#false} is VALID [2022-04-27 16:10:48,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} [115] L7-->L8: 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[] {32#false} is VALID [2022-04-27 16:10:48,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:10:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:10:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:48,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562037360] [2022-04-27 16:10:48,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562037360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:10:48,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:10:48,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:10:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938787841] [2022-04-27 16:10:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:10:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:10:48,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:48,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:48,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:10:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:10:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:10:48,069 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,158 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-04-27 16:10:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:10:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:10:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:10:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 16:10:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 16:10:48,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 16:10:48,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:48,231 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:10:48,231 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 16:10:48,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:10:48,236 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:10:48,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:10:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 16:10:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 16:10:48,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:10:48,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,259 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,259 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,261 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 16:10:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 16:10:48,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:48,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:48,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 16:10:48,262 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 16:10:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,268 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 16:10:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 16:10:48,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:48,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:48,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:10:48,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:10:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-27 16:10:48,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-27 16:10:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:10:48,271 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-27 16:10:48,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 16:10:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:10:48,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:48,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:48,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:10:48,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash -935056948, now seen corresponding path program 1 times [2022-04-27 16:10:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:48,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908284853] [2022-04-27 16:10:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {133#true} is VALID [2022-04-27 16:10:48,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 16:10:48,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 16:10:48,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {133#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:10:48,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {133#true} is VALID [2022-04-27 16:10:48,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 16:10:48,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 16:10:48,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {133#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-27 16:10:48,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {138#(= main_~x~0 0)} is VALID [2022-04-27 16:10:48,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#(= main_~x~0 0)} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-27 16:10:48,395 INFO L272 TraceCheckUtils]: 7: Hoare triple {134#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {134#false} is VALID [2022-04-27 16:10:48,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#false} [112] __VERIFIER_assertENTRY-->L7: 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] {134#false} is VALID [2022-04-27 16:10:48,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#false} [115] L7-->L8: 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[] {134#false} is VALID [2022-04-27 16:10:48,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-27 16:10:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:10:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:48,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908284853] [2022-04-27 16:10:48,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908284853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:10:48,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:10:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:10:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943648435] [2022-04-27 16:10:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:10:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:10:48,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:48,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:48,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:10:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:10:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:10:48,415 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,512 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 16:10:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:10:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:10:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:10:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 16:10:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 16:10:48,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-27 16:10:48,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:48,550 INFO L225 Difference]: With dead ends: 24 [2022-04-27 16:10:48,551 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 16:10:48,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:10:48,553 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:10:48,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:10:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 16:10:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 16:10:48,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:10:48,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,559 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,560 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,561 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 16:10:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 16:10:48,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:48,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:48,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 16:10:48,562 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 16:10:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:48,564 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 16:10:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 16:10:48,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:48,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:48,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:10:48,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:10:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-27 16:10:48,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-27 16:10:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:10:48,566 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-27 16:10:48,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-27 16:10:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:10:48,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:48,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:48,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:10:48,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 982716702, now seen corresponding path program 1 times [2022-04-27 16:10:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000786579] [2022-04-27 16:10:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {239#true} is VALID [2022-04-27 16:10:48,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:48,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239#true} {239#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:48,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:10:48,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {239#true} is VALID [2022-04-27 16:10:48,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:48,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:48,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:48,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {244#(= main_~x~0 0)} is VALID [2022-04-27 16:10:48,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {244#(= main_~x~0 0)} is VALID [2022-04-27 16:10:48,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(= main_~x~0 0)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {245#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:10:48,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {246#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:10:48,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {247#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:10:48,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {248#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:10:48,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {248#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:10:48,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {250#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:10:48,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {250#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:10:48,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {252#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:10:48,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {253#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:10:48,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {253#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {254#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:10:48,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {254#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:48,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {240#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {240#false} is VALID [2022-04-27 16:10:48,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#false} [112] __VERIFIER_assertENTRY-->L7: 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] {240#false} is VALID [2022-04-27 16:10:48,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {240#false} [115] L7-->L8: 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[] {240#false} is VALID [2022-04-27 16:10:48,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {240#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:10:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000786579] [2022-04-27 16:10:48,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000786579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:10:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186667392] [2022-04-27 16:10:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:48,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:10:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:10:48,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:10:48,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:10:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 16:10:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:48,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:10:49,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {239#true} is VALID [2022-04-27 16:10:49,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {244#(= main_~x~0 0)} is VALID [2022-04-27 16:10:49,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {244#(= main_~x~0 0)} is VALID [2022-04-27 16:10:49,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(= main_~x~0 0)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {245#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:10:49,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {246#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:10:49,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {247#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:10:49,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {248#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:10:49,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {248#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:10:49,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {250#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:10:49,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {250#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:10:49,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {252#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:10:49,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {253#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:10:49,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {253#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:10:49,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:49,243 INFO L272 TraceCheckUtils]: 18: Hoare triple {240#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {240#false} is VALID [2022-04-27 16:10:49,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#false} [112] __VERIFIER_assertENTRY-->L7: 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] {240#false} is VALID [2022-04-27 16:10:49,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {240#false} [115] L7-->L8: 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[] {240#false} is VALID [2022-04-27 16:10:49,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {240#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:10:49,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:10:49,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {240#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:49,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {240#false} [115] L7-->L8: 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[] {240#false} is VALID [2022-04-27 16:10:49,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {240#false} [112] __VERIFIER_assertENTRY-->L7: 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] {240#false} is VALID [2022-04-27 16:10:49,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {240#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {240#false} is VALID [2022-04-27 16:10:49,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#(< (mod main_~x~0 4294967296) 99)} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-27 16:10:49,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {339#(< (mod (+ main_~x~0 2) 4294967296) 99)} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {335#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 16:10:49,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(< (mod (+ main_~x~0 4) 4294967296) 99)} [132] L39-1-->L42-1: Formula: (and (= v_main_~x~0_43 (+ v_main_~x~0_44 2)) (= (mod v_main_~y~0_22 2) 0)) InVars {main_~x~0=v_main_~x~0_44, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[main_~x~0] {339#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 16:10:49,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(< (mod (+ main_~x~0 6) 4294967296) 99)} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {343#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 16:10:49,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(< (mod (+ main_~x~0 8) 4294967296) 99)} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {347#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 16:10:49,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {355#(< (mod (+ main_~x~0 10) 4294967296) 99)} [126] L30-1-->L33-1: Formula: (and (= (mod v_main_~y~0_16 2) 0) (= v_main_~x~0_31 (+ v_main_~x~0_32 2))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_31, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0] {351#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 16:10:49,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#(< (mod (+ main_~x~0 12) 4294967296) 99)} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {355#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 16:10:49,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {363#(< (mod (+ main_~x~0 14) 4294967296) 99)} [122] L24-1-->L27-1: Formula: (and (= v_main_~x~0_23 (+ v_main_~x~0_24 2)) (= (mod v_main_~y~0_12 2) 0)) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[main_~x~0] {359#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 16:10:49,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(< (mod (+ main_~x~0 16) 4294967296) 99)} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {363#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 16:10:49,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(< (mod (+ main_~x~0 18) 4294967296) 99)} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {367#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 16:10:49,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#(< (mod (+ main_~x~0 20) 4294967296) 99)} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {371#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 16:10:49,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(< (mod (+ main_~x~0 20) 4294967296) 99)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {375#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 16:10:49,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {375#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 16:10:49,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {239#true} is VALID [2022-04-27 16:10:49,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-27 16:10:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:10:49,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186667392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:10:49,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:10:49,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 16:10:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151679515] [2022-04-27 16:10:49,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:10:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:10:49,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:49,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:49,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:49,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 16:10:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 16:10:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 16:10:49,597 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:12,476 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-27 16:11:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-27 16:11:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 655 transitions. [2022-04-27 16:11:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 655 transitions. [2022-04-27 16:11:12,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 655 transitions. [2022-04-27 16:11:13,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:13,965 INFO L225 Difference]: With dead ends: 336 [2022-04-27 16:11:13,965 INFO L226 Difference]: Without dead ends: 336 [2022-04-27 16:11:13,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1529, Invalid=4021, Unknown=0, NotChecked=0, Total=5550 [2022-04-27 16:11:13,966 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 226 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2822 mSolverCounterSat, 1724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1724 IncrementalHoareTripleChecker+Valid, 2822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:13,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 82 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1724 Valid, 2822 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-27 16:11:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-27 16:11:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 272. [2022-04-27 16:11:13,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:13,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:13,984 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:13,985 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:13,998 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-27 16:11:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-27 16:11:14,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 336 states. [2022-04-27 16:11:14,006 INFO L87 Difference]: Start difference. First operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 336 states. [2022-04-27 16:11:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,019 INFO L93 Difference]: Finished difference Result 336 states and 634 transitions. [2022-04-27 16:11:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 634 transitions. [2022-04-27 16:11:14,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:14,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.895131086142322) internal successors, (506), 267 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 510 transitions. [2022-04-27 16:11:14,029 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 510 transitions. Word has length 22 [2022-04-27 16:11:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:14,029 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 510 transitions. [2022-04-27 16:11:14,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 510 transitions. [2022-04-27 16:11:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:11:14,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:14,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:14,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:11:14,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:14,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1831418748, now seen corresponding path program 1 times [2022-04-27 16:11:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:14,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543924451] [2022-04-27 16:11:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {1783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1777#true} is VALID [2022-04-27 16:11:14,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:14,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {1777#true} is VALID [2022-04-27 16:11:14,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {1777#true} is VALID [2022-04-27 16:11:14,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1777#true} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {1777#true} is VALID [2022-04-27 16:11:14,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#true} [109] L18-->L18-2: Formula: (and (= v_main_~x~0_11 (+ v_main_~x~0_12 2)) (= (mod v_main_~y~0_6 2) 0)) InVars {main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0] {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 16:11:14,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [113] L18-2-->L21-1: Formula: (and (= v_main_~x~0_15 (+ v_main_~x~0_16 2)) (= (mod v_main_~y~0_8 2) 0)) InVars {main_~x~0=v_main_~x~0_16, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[main_~x~0] {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 16:11:14,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [117] L21-1-->L24-1: Formula: (and (= (+ v_main_~x~0_20 2) v_main_~x~0_19) (= (mod v_main_~y~0_10 2) 0)) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[main_~x~0] {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 16:11:14,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {1782#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1778#false} [124] L27-1-->L30-1: Formula: (and (= (mod v_main_~y~0_14 2) 0) (= v_main_~x~0_27 (+ v_main_~x~0_28 2))) InVars {main_~x~0=v_main_~x~0_28, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_27, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {1778#false} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1778#false} [128] L33-1-->L36-1: Formula: (and (= (+ v_main_~x~0_36 2) v_main_~x~0_35) (= (mod v_main_~y~0_18 2) 0)) InVars {main_~x~0=v_main_~x~0_36, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#false} [130] L36-1-->L39-1: Formula: (and (= (mod v_main_~y~0_20 2) 0) (= v_main_~x~0_39 (+ v_main_~x~0_40 2))) InVars {main_~x~0=v_main_~x~0_40, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L272 TraceCheckUtils]: 18: Hoare triple {1778#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1778#false} is VALID [2022-04-27 16:11:14,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#false} [112] __VERIFIER_assertENTRY-->L7: 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] {1778#false} is VALID [2022-04-27 16:11:14,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#false} [115] L7-->L8: 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[] {1778#false} is VALID [2022-04-27 16:11:14,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1778#false} is VALID [2022-04-27 16:11:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543924451] [2022-04-27 16:11:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543924451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:14,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:14,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:11:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242642426] [2022-04-27 16:11:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:14,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:14,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:14,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:11:14,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:11:14,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:11:14,304 INFO L87 Difference]: Start difference. First operand 272 states and 510 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,397 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-27 16:11:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:11:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-04-27 16:11:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-04-27 16:11:14,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2022-04-27 16:11:14,440 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-27 16:11:14,442 INFO L225 Difference]: With dead ends: 120 [2022-04-27 16:11:14,442 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 16:11:14,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:11:14,443 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:14,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 16:11:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 56. [2022-04-27 16:11:14,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:14,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,446 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,446 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,448 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-27 16:11:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-27 16:11:14,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-27 16:11:14,449 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-27 16:11:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,451 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-04-27 16:11:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-27 16:11:14,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:14,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-27 16:11:14,452 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2022-04-27 16:11:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:14,453 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-27 16:11:14,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-27 16:11:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:11:14,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:14,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:14,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:11:14,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 649784287, now seen corresponding path program 1 times [2022-04-27 16:11:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:14,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259590477] [2022-04-27 16:11:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2205#true} is VALID [2022-04-27 16:11:14,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2205#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2205#true} {2205#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {2205#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:14,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2205#true} is VALID [2022-04-27 16:11:14,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#true} {2205#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2205#true} is VALID [2022-04-27 16:11:14,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#true} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2205#true} is VALID [2022-04-27 16:11:14,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#true} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 16:11:14,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {2210#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} [134] L42-1-->L45-1: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (= (mod v_main_~y~0_3 2) 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0] {2206#false} is VALID [2022-04-27 16:11:14,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {2206#false} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2206#false} is VALID [2022-04-27 16:11:14,501 INFO L272 TraceCheckUtils]: 18: Hoare triple {2206#false} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2206#false} is VALID [2022-04-27 16:11:14,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#false} [112] __VERIFIER_assertENTRY-->L7: 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] {2206#false} is VALID [2022-04-27 16:11:14,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {2206#false} [115] L7-->L8: 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[] {2206#false} is VALID [2022-04-27 16:11:14,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {2206#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2206#false} is VALID [2022-04-27 16:11:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:14,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259590477] [2022-04-27 16:11:14,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259590477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:14,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:14,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:11:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747992417] [2022-04-27 16:11:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:14,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:14,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:14,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:11:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:11:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:11:14,528 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,613 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 16:11:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:11:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 16:11:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 16:11:14,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-27 16:11:14,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:14,652 INFO L225 Difference]: With dead ends: 57 [2022-04-27 16:11:14,653 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 16:11:14,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:11:14,653 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:14,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 16:11:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-27 16:11:14,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:14,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,656 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,656 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,657 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 16:11:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 16:11:14,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 16:11:14,658 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 16:11:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:14,659 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-27 16:11:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 16:11:14,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:14,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:14,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:14,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-27 16:11:14,661 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 22 [2022-04-27 16:11:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:14,661 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-27 16:11:14,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-27 16:11:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:11:14,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:14,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:14,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:11:14,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash 678413438, now seen corresponding path program 1 times [2022-04-27 16:11:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:14,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310681292] [2022-04-27 16:11:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {2453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2444#true} is VALID [2022-04-27 16:11:14,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:14,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2444#true} {2444#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:14,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {2444#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:14,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {2453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2444#true} is VALID [2022-04-27 16:11:14,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:14,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:14,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {2444#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:14,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2449#(= main_~x~0 0)} is VALID [2022-04-27 16:11:14,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {2449#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2449#(= main_~x~0 0)} is VALID [2022-04-27 16:11:14,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {2449#(= main_~x~0 0)} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 16:11:14,862 INFO L272 TraceCheckUtils]: 18: Hoare triple {2450#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2451#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:11:14,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {2451#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L7: 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] {2452#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:11:14,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {2452#(not (= __VERIFIER_assert_~cond 0))} [115] L7-->L8: 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[] {2445#false} is VALID [2022-04-27 16:11:14,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {2445#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#false} is VALID [2022-04-27 16:11:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:14,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310681292] [2022-04-27 16:11:14,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310681292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875969299] [2022-04-27 16:11:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:14,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:14,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:11:14,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:11:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 16:11:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:14,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:11:15,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {2444#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2444#true} is VALID [2022-04-27 16:11:15,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {2444#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2449#(= main_~x~0 0)} is VALID [2022-04-27 16:11:15,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {2449#(= main_~x~0 0)} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2449#(= main_~x~0 0)} is VALID [2022-04-27 16:11:15,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {2449#(= main_~x~0 0)} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2495#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} is VALID [2022-04-27 16:11:15,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2495#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {2478#(and (= (+ (- 1) main_~x~0) 0) (not (= (mod main_~y~0 2) 0)))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2502#(and (= (+ main_~x~0 (- 3)) 0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {2502#(and (= (+ main_~x~0 (- 3)) 0) (not (= (mod main_~y~0 2) 0)))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 16:11:15,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {2482#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {2509#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-27 16:11:15,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {2509#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2509#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-27 16:11:15,337 INFO L272 TraceCheckUtils]: 18: Hoare triple {2509#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:11:15,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L7: 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] {2520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:11:15,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {2520#(<= 1 __VERIFIER_assert_~cond)} [115] L7-->L8: 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[] {2445#false} is VALID [2022-04-27 16:11:15,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {2445#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#false} is VALID [2022-04-27 16:11:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:15,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:11:15,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {2445#false} [119] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#false} is VALID [2022-04-27 16:11:15,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {2520#(<= 1 __VERIFIER_assert_~cond)} [115] L7-->L8: 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[] {2445#false} is VALID [2022-04-27 16:11:15,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L7: 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] {2520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:11:15,707 INFO L272 TraceCheckUtils]: 18: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [108] L17-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_23 2) (mod v_main_~x~0_45 2)) 1 0)) InVars {main_~x~0=v_main_~x~0_45, main_~y~0=v_main_~y~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:11:15,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [106] L45-1-->L17-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [135] L42-1-->L45-1: Formula: (and (not (= (mod v_main_~y~0_4 2) 0)) (= (+ v_main_~x~0_7 (- 4)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [133] L39-1-->L42-1: Formula: (and (not (= (mod v_main_~y~0_1 2) 0)) (= v_main_~x~0_1 (+ v_main_~x~0_2 (- 4)))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [131] L36-1-->L39-1: Formula: (and (= v_main_~x~0_41 (+ v_main_~x~0_42 2)) (not (= 0 (mod v_main_~y~0_21 2)))) InVars {main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [129] L33-1-->L36-1: Formula: (and (not (= (mod v_main_~y~0_19 2) 0)) (= (+ v_main_~x~0_38 4) v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_37, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [127] L30-1-->L33-1: Formula: (and (not (= (mod v_main_~y~0_17 2) 0)) (= v_main_~x~0_33 (+ v_main_~x~0_34 (- 4)))) InVars {main_~x~0=v_main_~x~0_34, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_33, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [125] L27-1-->L30-1: Formula: (and (= v_main_~x~0_29 (+ v_main_~x~0_30 2)) (not (= (mod v_main_~y~0_15 2) 0))) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_29, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [123] L24-1-->L27-1: Formula: (and (= v_main_~x~0_25 (+ v_main_~x~0_26 (- 2))) (not (= (mod v_main_~y~0_13 2) 0))) InVars {main_~x~0=v_main_~x~0_26, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_25, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [118] L21-1-->L24-1: Formula: (and (= v_main_~x~0_21 (+ v_main_~x~0_22 2)) (not (= (mod v_main_~y~0_11 2) 0))) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_21, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} [114] L18-2-->L21-1: Formula: (and (= v_main_~x~0_17 (+ v_main_~x~0_18 (- 2))) (not (= (mod v_main_~y~0_9 2) 0))) InVars {main_~x~0=v_main_~x~0_18, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[main_~x~0] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {2570#(<= 1 (mod (+ main_~x~0 1) 2))} [110] L18-->L18-2: Formula: (and (not (= (mod v_main_~y~0_7 2) 0)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_7} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2536#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 16:11:15,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {2570#(<= 1 (mod (+ main_~x~0 1) 2))} [107] L45-1-->L18: Formula: (< (mod v_main_~x~0_9 4294967296) 99) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] {2570#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 16:11:15,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#true} [103] mainENTRY-->L45-1: Formula: (and (= v_main_~y~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {2570#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 16:11:15,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {2444#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (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] {2444#true} is VALID [2022-04-27 16:11:15,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {2444#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-27 16:11:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:11:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875969299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:11:15,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:11:15,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 16 [2022-04-27 16:11:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140618220] [2022-04-27 16:11:15,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:11:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:15,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:15,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:15,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:15,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 16:11:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 16:11:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:11:15,759 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:16,239 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-04-27 16:11:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 16:11:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:11:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-27 16:11:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-27 16:11:16,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-27 16:11:16,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:16,272 INFO L225 Difference]: With dead ends: 54 [2022-04-27 16:11:16,273 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:11:16,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-27 16:11:16,273 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:16,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:11:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:11:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:11:16,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:16,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:16,274 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:16,274 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:16,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:16,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:16,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:16,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:11:16,275 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:11:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:16,275 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:16,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:16,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:16,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:16,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:11:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:11:16,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 16:11:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:16,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:11:16,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:16,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:16,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:11:16,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:11:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 16:11:16,481 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 16:11:16,482 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:11:16,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:11:16 BasicIcfg [2022-04-27 16:11:16,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:11:16,484 INFO L158 Benchmark]: Toolchain (without parser) took 29348.20ms. Allocated memory was 210.8MB in the beginning and 268.4MB in the end (delta: 57.7MB). Free memory was 163.1MB in the beginning and 163.6MB in the end (delta: -465.5kB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 210.8MB. Free memory was 163.0MB in the beginning and 187.0MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: Boogie Preprocessor took 43.53ms. Allocated memory is still 210.8MB. Free memory was 187.0MB in the beginning and 185.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: RCFGBuilder took 309.00ms. Allocated memory is still 210.8MB. Free memory was 185.3MB in the beginning and 173.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: IcfgTransformer took 35.70ms. Allocated memory is still 210.8MB. Free memory was 173.0MB in the beginning and 171.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,485 INFO L158 Benchmark]: TraceAbstraction took 28742.06ms. Allocated memory was 210.8MB in the beginning and 268.4MB in the end (delta: 57.7MB). Free memory was 170.9MB in the beginning and 163.6MB in the end (delta: 7.3MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2022-04-27 16:11:16,486 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 210.8MB. Free memory was 163.0MB in the beginning and 187.0MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.53ms. Allocated memory is still 210.8MB. Free memory was 187.0MB in the beginning and 185.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 309.00ms. Allocated memory is still 210.8MB. Free memory was 185.3MB in the beginning and 173.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 35.70ms. Allocated memory is still 210.8MB. Free memory was 173.0MB in the beginning and 171.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 28742.06ms. Allocated memory was 210.8MB in the beginning and 268.4MB in the end (delta: 57.7MB). Free memory was 170.9MB in the beginning and 163.6MB in the end (delta: 7.3MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 1811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3144 IncrementalHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1811 mSolverCounterUnsat, 132 mSDtfsCounter, 3144 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=3, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 130 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 3 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:11:16,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...