/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:26:57,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:26:57,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:26:57,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:26:57,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:26:57,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:26:57,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:26:57,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:26:57,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:26:57,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:26:57,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:26:57,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:26:57,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:26:57,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:26:57,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:26:57,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:26:57,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:26:57,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:26:57,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:26:57,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:26:57,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:26:57,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:26:57,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:26:57,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:26:57,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:26:57,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:26:57,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:26:57,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:26:57,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:26:57,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:26:57,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:26:57,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:26:57,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:26:57,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:26:57,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:26:57,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:26:57,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:26:57,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:26:57,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:26:57,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:26:57,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:26:57,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:26:57,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:26:57,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:26:57,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:26:57,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:26:57,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:26:57,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:26:57,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:26:57,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:26:57,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:26:57,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:26:57,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:26:57,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:26:57,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:26:57,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:26:57,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:26:57,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:26:57,650 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:26:57,650 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-14 19:26:57,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:26:57,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:26:57,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:26:57,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:26:57,845 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:26:57,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-14 19:26:57,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9b15439/21806cab2e344e9b87763baf1d42d265/FLAG523d04d5b [2022-04-14 19:26:58,206 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:26:58,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-14 19:26:58,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9b15439/21806cab2e344e9b87763baf1d42d265/FLAG523d04d5b [2022-04-14 19:26:58,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9b15439/21806cab2e344e9b87763baf1d42d265 [2022-04-14 19:26:58,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:26:58,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:26:58,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:26:58,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:26:58,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:26:58,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3519f1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58, skipping insertion in model container [2022-04-14 19:26:58,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:26:58,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:26:58,841 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-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-14 19:26:58,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:26:58,852 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:26:58,872 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-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-14 19:26:58,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:26:58,885 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:26:58,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58 WrapperNode [2022-04-14 19:26:58,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:26:58,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:26:58,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:26:58,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:26:58,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:26:58,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:26:58,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:26:58,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:26:58,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (1/1) ... [2022-04-14 19:26:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:26:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:26:58,942 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-14 19:26:58,947 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-14 19:26:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:26:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:26:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:26:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:26:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:26:59,011 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:26:59,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:27:07,791 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:27:07,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:27:07,796 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-14 19:27:07,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:27:07 BoogieIcfgContainer [2022-04-14 19:27:07,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:27:07,798 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:27:07,798 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:27:07,799 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:27:07,801 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:27:07" (1/1) ... [2022-04-14 19:27:07,802 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:27:07,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:27:07 BasicIcfg [2022-04-14 19:27:07,835 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:27:07,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:27:07,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:27:07,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:27:07,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:26:58" (1/4) ... [2022-04-14 19:27:07,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ea7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:27:07, skipping insertion in model container [2022-04-14 19:27:07,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:58" (2/4) ... [2022-04-14 19:27:07,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ea7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:27:07, skipping insertion in model container [2022-04-14 19:27:07,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:27:07" (3/4) ... [2022-04-14 19:27:07,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ea7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:27:07, skipping insertion in model container [2022-04-14 19:27:07,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:27:07" (4/4) ... [2022-04-14 19:27:07,844 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+sep-reducer.cJordan [2022-04-14 19:27:07,847 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:27:07,847 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:27:07,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:27:07,899 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-14 19:27:07,899 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:27:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 19:27:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:27:07,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:27:07,918 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:27:07,918 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:27:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:27:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1219544613, now seen corresponding path program 1 times [2022-04-14 19:27:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:27:07,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432471634] [2022-04-14 19:27:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:27:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:27:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:27:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:27:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:27:08,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {31#true} is VALID [2022-04-14 19:27:08,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:27:08,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:27:08,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:27:08,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {31#true} is VALID [2022-04-14 19:27:08,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:27:08,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:27:08,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:27:08,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-14 19:27:08,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-14 19:27:08,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-14 19:27:10,577 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [84] L24-->L52: Formula: (and (= 0 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_31_0~0_1) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_31_0~0, main_~main__x~0, main_~main__y~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-14 19:27:10,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L52-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_31_0~0_2) InVars {~__tmp_31_0~0=v_~__tmp_31_0~0_2} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:27:10,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:27:10,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:27:10,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:27:10,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-14 19:27:10,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-14 19:27:10,599 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-14 19:27:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:27:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432471634] [2022-04-14 19:27:10,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432471634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:27:10,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:27:10,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:27:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004292537] [2022-04-14 19:27:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:27:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 19:27:10,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:27:10,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:27:12,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:27:12,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:27:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:27:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:27:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:27:12,773 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:27:19,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:23,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:27,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:30,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:36,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:38,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:41,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:43,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:45,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:51,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:56,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:58,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:00,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:02,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:07,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:09,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:11,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:13,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:15,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:15,927 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 19:28:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:28:16,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 19:28:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:28:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 19:28:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 19:28:16,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-14 19:28:18,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:28:18,317 INFO L225 Difference]: With dead ends: 49 [2022-04-14 19:28:18,317 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 19:28:18,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 19:28:18,320 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2022-04-14 19:28:18,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 19 Unknown, 0 Unchecked, 40.5s Time] [2022-04-14 19:28:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 19:28:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-14 19:28:18,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:28:18,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:18,339 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:18,340 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:18,342 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-14 19:28:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 19:28:18,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:28:18,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:28:18,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-14 19:28:18,343 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-14 19:28:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:18,345 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-14 19:28:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 19:28:18,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:28:18,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:28:18,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:28:18,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:28:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-14 19:28:18,348 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-14 19:28:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:28:18,348 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-14 19:28:18,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-14 19:28:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:28:18,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:28:18,349 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:28:18,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:28:18,349 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:28:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:28:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash -791971888, now seen corresponding path program 1 times [2022-04-14 19:28:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:28:18,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475070463] [2022-04-14 19:28:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:28:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:28:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:28:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:28:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:28:18,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {197#true} is VALID [2022-04-14 19:28:18,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:28:18,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:28:18,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:28:18,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {197#true} is VALID [2022-04-14 19:28:18,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:28:18,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:28:18,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:28:18,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-14 19:28:18,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-14 19:28:18,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-14 19:28:18,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-14 19:28:20,850 WARN L290 TraceCheckUtils]: 9: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [88] L35-->L61: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_28_0~0_1) (= (+ v_main_~main__x~0_6 1) v_main_~main__x~0_5) (= 2 (mod (mod (mod v_main_~main__x~0_6 4294967296) 3) 4294967296)) (= 0 v_main_~main__y~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, main_~main__x~0=v_main_~main__x~0_5, ~__tmp_28_0~0=v_~__tmp_28_0~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[~__tmp_28_0~0, main_~main__x~0, main_~main__y~0] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-14 19:28:20,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L61-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_28_0~0_2) InVars {~__tmp_28_0~0=v_~__tmp_28_0~0_2} OutVars{~__tmp_28_0~0=v_~__tmp_28_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:28:20,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:28:20,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:28:20,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {204#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:28:20,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-14 19:28:20,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-14 19:28:20,868 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-14 19:28:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:28:20,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475070463] [2022-04-14 19:28:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475070463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:28:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:28:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:28:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889302560] [2022-04-14 19:28:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:28:20,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-14 19:28:20,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:28:20,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:23,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:28:23,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:28:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:28:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:28:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:28:23,063 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:28:27,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:29,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:31,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:33,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:35,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:38,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:40,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:42,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:49,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:51,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:57,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:59,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:04,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:06,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:08,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:12,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:17,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:19,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:21,697 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 19:29:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:29:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-14 19:29:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:29:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 19:29:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 19:29:21,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-14 19:29:26,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 19:29:26,135 INFO L225 Difference]: With dead ends: 43 [2022-04-14 19:29:26,135 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 19:29:26,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 19:29:26,136 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.2s IncrementalHoareTripleChecker+Time [2022-04-14 19:29:26,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 18 Unknown, 0 Unchecked, 38.2s Time] [2022-04-14 19:29:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 19:29:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-14 19:29:26,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:29:26,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:26,139 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:26,139 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:26,141 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 19:29:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 19:29:26,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:29:26,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:29:26,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-14 19:29:26,141 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-14 19:29:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:26,143 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 19:29:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 19:29:26,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:29:26,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:29:26,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:29:26,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:29:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-14 19:29:26,145 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-14 19:29:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:29:26,146 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-14 19:29:26,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-14 19:29:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 19:29:26,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:29:26,146 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:29:26,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:29:26,147 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:29:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:29:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1083849817, now seen corresponding path program 1 times [2022-04-14 19:29:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:29:26,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904123192] [2022-04-14 19:29:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:29:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:29:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:29:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:29:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:29:26,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {371#true} is VALID [2022-04-14 19:29:26,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:29:26,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {371#true} is VALID [2022-04-14 19:29:26,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {371#true} is VALID [2022-04-14 19:29:26,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {371#true} is VALID [2022-04-14 19:29:26,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} [89] L35-->L117: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#true} [92] L117-->L123: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_22_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_10 v_~__tmp_22_0~0_2) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10, ~__tmp_22_1~0=v_~__tmp_22_1~0_2, ~__tmp_22_0~0=v_~__tmp_22_0~0_2} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0, ~__tmp_22_1~0, ~__tmp_22_0~0] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#true} [96] L123-->L138: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_11 v_~__tmp_22_0~0_3) (= v_main_~main____CPAchecker_TMP_1~1_4 v_~__tmp_22_1~0_3)) InVars {~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_11, ~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_~main____CPAchecker_TMP_0~0] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:26,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {371#true} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {371#true} is VALID [2022-04-14 19:29:28,509 WARN L290 TraceCheckUtils]: 15: Hoare triple {371#true} [88] L35-->L61: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_28_0~0_1) (= (+ v_main_~main__x~0_6 1) v_main_~main__x~0_5) (= 2 (mod (mod (mod v_main_~main__x~0_6 4294967296) 3) 4294967296)) (= 0 v_main_~main__y~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, main_~main__x~0=v_main_~main__x~0_5, ~__tmp_28_0~0=v_~__tmp_28_0~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[~__tmp_28_0~0, main_~main__x~0, main_~main__y~0] {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-14 19:29:28,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L61-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_28_0~0_2) InVars {~__tmp_28_0~0=v_~__tmp_28_0~0_2} OutVars{~__tmp_28_0~0=v_~__tmp_28_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:29:28,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:29:28,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-14 19:29:28,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {376#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {377#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:29:28,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-14 19:29:28,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {372#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-14 19:29:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 19:29:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:29:28,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904123192] [2022-04-14 19:29:28,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904123192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:29:28,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:29:28,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:29:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886957359] [2022-04-14 19:29:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:29:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 19:29:28,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:29:28,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:30,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:29:30,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:29:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:29:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:29:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:29:30,706 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:29:34,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:37,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:39,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:41,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:43,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:47,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:54,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:56,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:58,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:03,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:05,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:05,565 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-14 19:30:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:30:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 19:30:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:30:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:30:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 19:30:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:30:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 19:30:05,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-14 19:30:09,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 19:30:09,968 INFO L225 Difference]: With dead ends: 37 [2022-04-14 19:30:09,968 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:30:09,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:30:09,975 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:30:09,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 23.1s Time] [2022-04-14 19:30:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:30:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:30:09,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:30:09,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:09,978 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:09,978 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:09,978 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:30:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:09,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:09,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:30:09,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:30:09,978 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:30:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:09,978 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:30:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:09,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:09,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:30:09,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:30:09,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:30:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:30:09,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-14 19:30:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:30:09,979 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:30:09,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:30:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:09,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:09,981 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:30:09,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 19:30:09,985 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 19:30:09,987 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:30:09,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:30:09 BasicIcfg [2022-04-14 19:30:09,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:30:09,990 INFO L158 Benchmark]: Toolchain (without parser) took 191356.77ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 144.7MB in the beginning and 163.0MB in the end (delta: -18.3MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,991 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:30:09,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.98ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 169.9MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,992 INFO L158 Benchmark]: Boogie Preprocessor took 21.78ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 168.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,992 INFO L158 Benchmark]: RCFGBuilder took 8881.02ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 155.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,993 INFO L158 Benchmark]: IcfgTransformer took 37.11ms. Allocated memory is still 195.0MB. Free memory was 155.4MB in the beginning and 153.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,993 INFO L158 Benchmark]: TraceAbstraction took 182153.63ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 153.1MB in the beginning and 163.0MB in the end (delta: -9.9MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2022-04-14 19:30:09,994 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.98ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 169.9MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.78ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 168.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8881.02ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 155.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 37.11ms. Allocated memory is still 195.0MB. Free memory was 155.4MB in the beginning and 153.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 182153.63ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 153.1MB in the beginning and 163.0MB in the end (delta: -9.9MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 182.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 167.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 48 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 101.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 96.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 80 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 19:30:10,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...