/usr/bin/java -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/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 00:23:31,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 00:23:31,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 00:23:31,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 00:23:31,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 00:23:31,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 00:23:31,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 00:23:31,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 00:23:31,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 00:23:31,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 00:23:31,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 00:23:31,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 00:23:31,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 00:23:31,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 00:23:31,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 00:23:31,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 00:23:31,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 00:23:31,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 00:23:31,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 00:23:31,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 00:23:31,648 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 00:23:31,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 00:23:31,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 00:23:31,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 00:23:31,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 00:23:31,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 00:23:31,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 00:23:31,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 00:23:31,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 00:23:31,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 00:23:31,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 00:23:31,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 00:23:31,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 00:23:31,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 00:23:31,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 00:23:31,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 00:23:31,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 00:23:31,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 00:23:31,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 00:23:31,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 00:23:31,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 00:23:31,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 00:23:31,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 00:23:31,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 00:23:31,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 00:23:31,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 00:23:31,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 00:23:31,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 00:23:31,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 00:23:31,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 00:23:31,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 00:23:31,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:23:31,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 00:23:31,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 00:23:31,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 00:23:31,685 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-05 00:23:31,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 00:23:31,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 00:23:31,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 00:23:31,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 00:23:31,921 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 00:23:31,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-05 00:23:31,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4729fdb7/e4b1cbb899c94ebe8061a2ae69bbc1d9/FLAGe98b2dca0 [2022-04-05 00:23:32,319 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 00:23:32,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-05 00:23:32,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4729fdb7/e4b1cbb899c94ebe8061a2ae69bbc1d9/FLAGe98b2dca0 [2022-04-05 00:23:32,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4729fdb7/e4b1cbb899c94ebe8061a2ae69bbc1d9 [2022-04-05 00:23:32,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 00:23:32,342 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 00:23:32,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 00:23:32,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 00:23:32,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 00:23:32,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f1842d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32, skipping insertion in model container [2022-04-05 00:23:32,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 00:23:32,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 00:23:32,528 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/functions_1-2.c[325,338] [2022-04-05 00:23:32,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:23:32,547 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 00:23:32,556 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/functions_1-2.c[325,338] [2022-04-05 00:23:32,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:23:32,571 INFO L208 MainTranslator]: Completed translation [2022-04-05 00:23:32,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32 WrapperNode [2022-04-05 00:23:32,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 00:23:32,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 00:23:32,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 00:23:32,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 00:23:32,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 00:23:32,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 00:23:32,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 00:23:32,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 00:23:32,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:23:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:23:32,624 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-05 00:23:32,634 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-05 00:23:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 00:23:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 00:23:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 00:23:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 00:23:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-05 00:23:32,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 00:23:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 00:23:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 00:23:32,693 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 00:23:32,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 00:23:32,763 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 00:23:32,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 00:23:32,768 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 00:23:32,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:23:32 BoogieIcfgContainer [2022-04-05 00:23:32,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 00:23:32,770 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 00:23:32,770 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 00:23:32,770 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 00:23:32,772 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:23:32" (1/1) ... [2022-04-05 00:23:32,774 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 00:23:32,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:23:32 BasicIcfg [2022-04-05 00:23:32,782 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 00:23:32,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 00:23:32,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 00:23:32,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 00:23:32,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:23:32" (1/4) ... [2022-04-05 00:23:32,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d375db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:23:32, skipping insertion in model container [2022-04-05 00:23:32,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:23:32" (2/4) ... [2022-04-05 00:23:32,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d375db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:23:32, skipping insertion in model container [2022-04-05 00:23:32,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:23:32" (3/4) ... [2022-04-05 00:23:32,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d375db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:23:32, skipping insertion in model container [2022-04-05 00:23:32,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:23:32" (4/4) ... [2022-04-05 00:23:32,787 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.cJordan [2022-04-05 00:23:32,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 00:23:32,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 00:23:32,818 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 00:23:32,822 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 00:23:32,823 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 00:23:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 00:23:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 00:23:32,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:32,838 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:32,838 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1565505021, now seen corresponding path program 1 times [2022-04-05 00:23:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:32,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856231968] [2022-04-05 00:23:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,026 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-05 00:23:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856231968] [2022-04-05 00:23:33,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856231968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:23:33,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:23:33,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 00:23:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960076132] [2022-04-05 00:23:33,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:23:33,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 00:23:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 00:23:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 00:23:33,075 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-05 00:23:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:23:33,110 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-05 00:23:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 00:23:33,116 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-05 00:23:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:23:33,120 INFO L225 Difference]: With dead ends: 23 [2022-04-05 00:23:33,120 INFO L226 Difference]: Without dead ends: 17 [2022-04-05 00:23:33,121 INFO L912 BasicCegarLoop]: 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-05 00:23:33,124 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 00:23:33,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 00:23:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-05 00:23:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-05 00:23:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 00:23:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-05 00:23:33,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-05 00:23:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:23:33,149 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-05 00:23:33,149 INFO L479 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-05 00:23:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-05 00:23:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 00:23:33,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:33,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:33,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 00:23:33,151 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1564581500, now seen corresponding path program 1 times [2022-04-05 00:23:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:33,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483612414] [2022-04-05 00:23:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,273 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-05 00:23:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483612414] [2022-04-05 00:23:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483612414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:23:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:23:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:23:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858037551] [2022-04-05 00:23:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:23:33,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:23:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:33,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:23:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:23:33,278 INFO L87 Difference]: Start difference. First operand 17 states and 17 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-05 00:23:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:23:33,318 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-05 00:23:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:23:33,319 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-05 00:23:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:23:33,320 INFO L225 Difference]: With dead ends: 20 [2022-04-05 00:23:33,321 INFO L226 Difference]: Without dead ends: 20 [2022-04-05 00:23:33,323 INFO L912 BasicCegarLoop]: 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-05 00:23:33,325 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 00:23:33,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 00:23:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-05 00:23:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-05 00:23:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 00:23:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-05 00:23:33,335 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-05 00:23:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:23:33,336 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-05 00:23:33,336 INFO L479 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-05 00:23:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-05 00:23:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 00:23:33,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:33,342 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:33,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 00:23:33,344 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:33,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1890585047, now seen corresponding path program 1 times [2022-04-05 00:23:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:33,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99852454] [2022-04-05 00:23:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 00:23:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,513 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-05 00:23:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:33,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99852454] [2022-04-05 00:23:33,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99852454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:23:33,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292263706] [2022-04-05 00:23:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:23:33,539 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-05 00:23:33,573 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-05 00:23:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:33,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 00:23:33,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:23:33,775 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-05 00:23:33,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:23:33,908 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-05 00:23:33,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292263706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:23:33,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:23:33,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-05 00:23:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384544294] [2022-04-05 00:23:33,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:23:33,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 00:23:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 00:23:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-05 00:23:33,915 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 00:23:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:23:34,056 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-05 00:23:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 00:23:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-05 00:23:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:23:34,058 INFO L225 Difference]: With dead ends: 24 [2022-04-05 00:23:34,058 INFO L226 Difference]: Without dead ends: 24 [2022-04-05 00:23:34,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-05 00:23:34,059 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 00:23:34,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 00:23:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-05 00:23:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-05 00:23:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 00:23:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-05 00:23:34,062 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-05 00:23:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:23:34,062 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-05 00:23:34,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 00:23:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-05 00:23:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-05 00:23:34,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:34,064 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:34,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-05 00:23:34,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:34,280 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1393393715, now seen corresponding path program 2 times [2022-04-05 00:23:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:34,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302462949] [2022-04-05 00:23:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 00:23:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 00:23:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 00:23:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 00:23:34,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302462949] [2022-04-05 00:23:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302462949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:23:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766176840] [2022-04-05 00:23:34,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 00:23:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:23:34,507 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-05 00:23:34,508 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-05 00:23:34,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 00:23:34,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:23:34,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-05 00:23:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:23:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 00:23:34,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:23:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-05 00:23:34,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766176840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:23:34,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:23:34,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2022-04-05 00:23:34,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522374362] [2022-04-05 00:23:34,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:23:34,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-05 00:23:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-05 00:23:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-05 00:23:34,994 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-05 00:23:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:23:35,489 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-05 00:23:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 00:23:35,490 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2022-04-05 00:23:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:23:35,490 INFO L225 Difference]: With dead ends: 36 [2022-04-05 00:23:35,491 INFO L226 Difference]: Without dead ends: 36 [2022-04-05 00:23:35,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2022-04-05 00:23:35,492 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 00:23:35,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 00:23:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-05 00:23:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-05 00:23:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-05 00:23:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-05 00:23:35,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 29 [2022-04-05 00:23:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:23:35,496 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-05 00:23:35,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-05 00:23:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-05 00:23:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-05 00:23:35,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:35,497 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:35,519 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-05 00:23:35,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-05 00:23:35,704 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 638375751, now seen corresponding path program 3 times [2022-04-05 00:23:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:35,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007873055] [2022-04-05 00:23:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 00:23:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 00:23:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 00:23:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 00:23:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 00:23:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 00:23:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 00:23:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-05 00:23:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007873055] [2022-04-05 00:23:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007873055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:23:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327915655] [2022-04-05 00:23:36,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 00:23:36,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:36,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:23:36,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:23:36,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 00:23:36,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-05 00:23:36,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:23:36,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-05 00:23:36,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:23:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-05 00:23:36,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:23:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-05 00:23:37,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327915655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:23:37,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:23:37,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 42 [2022-04-05 00:23:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882477264] [2022-04-05 00:23:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:23:37,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-05 00:23:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-05 00:23:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-04-05 00:23:37,116 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-05 00:23:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:23:42,227 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-05 00:23:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-05 00:23:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 53 [2022-04-05 00:23:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:23:42,228 INFO L225 Difference]: With dead ends: 60 [2022-04-05 00:23:42,228 INFO L226 Difference]: Without dead ends: 60 [2022-04-05 00:23:42,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=845, Invalid=4267, Unknown=0, NotChecked=0, Total=5112 [2022-04-05 00:23:42,230 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 00:23:42,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 00:23:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-05 00:23:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-05 00:23:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-05 00:23:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-05 00:23:42,238 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 53 [2022-04-05 00:23:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:23:42,238 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-05 00:23:42,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-05 00:23:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-05 00:23:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:23:42,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:23:42,240 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:23:42,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 00:23:42,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:42,452 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:23:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:23:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1561497967, now seen corresponding path program 4 times [2022-04-05 00:23:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:23:42,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672817243] [2022-04-05 00:23:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:23:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:23:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:23:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 00:23:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 00:23:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 00:23:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 00:23:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 00:23:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 00:23:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 00:23:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 00:23:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 00:23:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-05 00:23:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-05 00:23:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-05 00:23:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-05 00:23:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 00:23:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-05 00:23:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:23:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-05 00:23:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:23:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672817243] [2022-04-05 00:23:43,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672817243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:23:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566811939] [2022-04-05 00:23:43,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 00:23:43,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:23:43,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:23:43,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:23:43,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 00:23:43,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 00:23:43,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:23:43,222 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 153 conjunts are in the unsatisfiable core [2022-04-05 00:23:43,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:23:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-05 00:23:43,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:23:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-05 00:23:46,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566811939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:23:46,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:23:46,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 48] total 82 [2022-04-05 00:23:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837600155] [2022-04-05 00:23:46,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:23:46,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-05 00:23:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:23:46,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-05 00:23:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5953, Unknown=0, NotChecked=0, Total=6642 [2022-04-05 00:23:46,586 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-05 00:26:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:26:19,004 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-04-05 00:26:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-05 00:26:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 101 [2022-04-05 00:26:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:26:19,006 INFO L225 Difference]: With dead ends: 108 [2022-04-05 00:26:19,006 INFO L226 Difference]: Without dead ends: 108 [2022-04-05 00:26:19,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 152.9s TimeCoverageRelationStatistics Valid=3101, Invalid=17491, Unknown=0, NotChecked=0, Total=20592 [2022-04-05 00:26:19,016 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-05 00:26:19,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 266 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 3832 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-05 00:26:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-05 00:26:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-05 00:26:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-05 00:26:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2022-04-05 00:26:19,027 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 101 [2022-04-05 00:26:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:26:19,028 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2022-04-05 00:26:19,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-05 00:26:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-04-05 00:26:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-05 00:26:19,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:26:19,034 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:26:19,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 00:26:19,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:26:19,251 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:26:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:26:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1223308735, now seen corresponding path program 5 times [2022-04-05 00:26:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:26:19,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600645641] [2022-04-05 00:26:19,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:26:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:26:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:26:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 00:26:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-05 00:26:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 00:26:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 00:26:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-05 00:26:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-05 00:26:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 00:26:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-05 00:26:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-05 00:26:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-05 00:26:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-05 00:26:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-05 00:26:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-05 00:26:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 00:26:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-05 00:26:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-04-05 00:26:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-05 00:26:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-05 00:26:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-04-05 00:26:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-04-05 00:26:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-04-05 00:26:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-04-05 00:26:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-05 00:26:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-04-05 00:26:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-04-05 00:26:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-05 00:26:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-04-05 00:26:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-04-05 00:26:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-04-05 00:26:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-04-05 00:26:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-04-05 00:26:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:26:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-05 00:26:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:26:21,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600645641] [2022-04-05 00:26:21,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600645641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 00:26:21,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557607738] [2022-04-05 00:26:21,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 00:26:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 00:26:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:26:21,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 00:26:21,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 00:26:37,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-05 00:26:37,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 00:26:37,382 WARN L261 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 313 conjunts are in the unsatisfiable core [2022-04-05 00:26:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 00:26:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-05 00:26:39,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 00:26:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-05 00:26:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557607738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 00:26:48,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 00:26:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 96] total 162 [2022-04-05 00:26:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757545187] [2022-04-05 00:26:48,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 00:26:48,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-04-05 00:26:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:26:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-04-05 00:26:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2401, Invalid=23681, Unknown=0, NotChecked=0, Total=26082 [2022-04-05 00:26:48,099 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-05 00:28:00,009 WARN L232 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 136 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:29:34,681 WARN L232 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 132 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:29:36,849 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 58) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 00:30:54,527 WARN L232 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:32:06,335 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 00:34:45,328 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-05 00:35:54,885 WARN L232 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 114 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 00:37:10,099 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false