/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:42:57,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:42:57,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:42:57,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:42:57,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:42:57,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:42:57,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:42:57,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:42:57,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:42:57,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:42:57,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:42:57,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:42:57,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:42:57,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:42:57,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:42:57,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:42:57,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:42:57,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:42:57,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:42:57,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:42:57,206 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:42:57,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:42:57,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:42:57,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:42:57,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:42:57,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:42:57,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:42:57,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:42:57,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:42:57,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:42:57,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:42:57,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:42:57,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:42:57,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:42:57,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:42:57,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:42:57,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:42:57,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:42:57,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:42:57,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:42:57,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:42:57,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:42:57,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:42:57,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:42:57,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:42:57,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:42:57,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:42:57,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:42:57,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:42:57,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:42:57,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:42:57,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:42:57,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:42:57,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:42:57,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:42:57,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:42:57,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:42:57,236 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:42:57,236 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 21:42:57,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:42:57,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:42:57,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:42:57,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:42:57,397 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:42:57,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c [2022-04-14 21:42:57,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22b9b6cf/0d2674f926c1456f976aecfbfd885958/FLAGa3bd3d81c [2022-04-14 21:42:57,751 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:42:57,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c [2022-04-14 21:42:57,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22b9b6cf/0d2674f926c1456f976aecfbfd885958/FLAGa3bd3d81c [2022-04-14 21:42:57,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22b9b6cf/0d2674f926c1456f976aecfbfd885958 [2022-04-14 21:42:57,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:42:57,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:42:57,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:42:57,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:42:57,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:42:57,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5f8eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57, skipping insertion in model container [2022-04-14 21:42:57,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:42:57,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:42:57,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c[525,538] [2022-04-14 21:42:57,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:42:57,931 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:42:57,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c[525,538] [2022-04-14 21:42:57,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:42:57,964 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:42:57,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57 WrapperNode [2022-04-14 21:42:57,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:42:57,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:42:57,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:42:57,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:42:57,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:57,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:42:57,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:42:57,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:42:57,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:42:57,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (1/1) ... [2022-04-14 21:42:58,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:42:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:58,015 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 21:42:58,023 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 21:42:58,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:42:58,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:42:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:42:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:42:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:42:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:42:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:42:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:42:58,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:42:58,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:42:58,260 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:42:58,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:42:58,285 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 21:42:58,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:58 BoogieIcfgContainer [2022-04-14 21:42:58,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:42:58,287 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:42:58,287 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:42:58,288 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:42:58,291 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:58" (1/1) ... [2022-04-14 21:42:58,292 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:42:58,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:42:58 BasicIcfg [2022-04-14 21:42:58,309 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:42:58,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:42:58,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:42:58,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:42:58,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:42:57" (1/4) ... [2022-04-14 21:42:58,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bb4944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:42:58, skipping insertion in model container [2022-04-14 21:42:58,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:42:57" (2/4) ... [2022-04-14 21:42:58,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bb4944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:42:58, skipping insertion in model container [2022-04-14 21:42:58,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:42:58" (3/4) ... [2022-04-14 21:42:58,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bb4944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:42:58, skipping insertion in model container [2022-04-14 21:42:58,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:42:58" (4/4) ... [2022-04-14 21:42:58,315 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound1.cJordan [2022-04-14 21:42:58,318 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:42:58,318 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:42:58,346 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:42:58,351 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 21:42:58,351 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:42:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 21:42:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 21:42:58,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:58,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:58,368 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-14 21:42:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:58,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037238847] [2022-04-14 21:42:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:42:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:58,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-14 21:42:58,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:42:58,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:42:58,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:42:58,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-14 21:42:58,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:42:58,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:42:58,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-14 21:42:58,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 1) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {25#true} is VALID [2022-04-14 21:42:58,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:42:58,558 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~y~0_9 v_main_~z~0_8)) (* v_main_~x~0_9 v_main_~z~0_8) (* (- 1) v_main_~x~0_9) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {26#false} is VALID [2022-04-14 21:42:58,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-14 21:42:58,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:42:58,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-14 21:42:58,559 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 21:42:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037238847] [2022-04-14 21:42:58,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037238847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:42:58,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:42:58,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:42:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987239266] [2022-04-14 21:42:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:42:58,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 21:42:58,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:58,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:58,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:58,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:42:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:58,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:42:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:42:58,622 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:58,716 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-14 21:42:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:42:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 21:42:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-14 21:42:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-14 21:42:58,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-14 21:42:58,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:58,790 INFO L225 Difference]: With dead ends: 23 [2022-04-14 21:42:58,790 INFO L226 Difference]: Without dead ends: 18 [2022-04-14 21:42:58,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:42:58,799 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:58,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:42:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-14 21:42:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-14 21:42:58,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:58,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:58,819 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:58,819 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:58,822 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 21:42:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 21:42:58,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:58,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:58,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-14 21:42:58,823 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-14 21:42:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:58,824 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 21:42:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 21:42:58,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:58,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:58,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:58,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 21:42:58,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-14 21:42:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:58,828 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 21:42:58,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 21:42:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 21:42:58,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:58,828 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:58,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 21:42:58,829 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:58,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-14 21:42:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:58,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828662702] [2022-04-14 21:42:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:58,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:42:58,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917208744] [2022-04-14 21:42:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:58,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:58,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:58,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:42:58,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 21:42:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:58,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 21:42:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:58,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:42:59,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {109#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-14 21:42:59,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {117#(<= ~counter~0 0)} is VALID [2022-04-14 21:42:59,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-14 21:42:59,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117#(<= ~counter~0 0)} {109#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-14 21:42:59,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {117#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID [2022-04-14 21:42:59,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(<= ~counter~0 0)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 1) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {117#(<= ~counter~0 0)} is VALID [2022-04-14 21:42:59,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#(<= ~counter~0 0)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {133#(<= |main_#t~post6| 0)} is VALID [2022-04-14 21:42:59,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= |main_#t~post6| 0)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_2| 1)) InVars {main_#t~post6=|v_main_#t~post6_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {110#false} is VALID [2022-04-14 21:42:59,045 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~y~0_9 v_main_~z~0_8)) (* v_main_~x~0_9 v_main_~z~0_8) (* (- 1) v_main_~x~0_9) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {110#false} is VALID [2022-04-14 21:42:59,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {110#false} is VALID [2022-04-14 21:42:59,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-14 21:42:59,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-14 21:42:59,046 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 21:42:59,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:42:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:59,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828662702] [2022-04-14 21:42:59,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:42:59,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917208744] [2022-04-14 21:42:59,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917208744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:42:59,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:42:59,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 21:42:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35020985] [2022-04-14 21:42:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:42:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 21:42:59,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:59,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:59,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 21:42:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 21:42:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:42:59,057 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,084 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:42:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 21:42:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 21:42:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 21:42:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 21:42:59,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-14 21:42:59,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:59,103 INFO L225 Difference]: With dead ends: 19 [2022-04-14 21:42:59,103 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 21:42:59,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:42:59,104 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:59,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:42:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 21:42:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 21:42:59,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:59,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:59,107 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:59,107 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,108 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:42:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:42:59,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:59,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:59,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 21:42:59,109 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 21:42:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,110 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 21:42:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:42:59,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:59,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:59,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:59,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:42:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-14 21:42:59,112 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-14 21:42:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:59,112 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-14 21:42:59,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 21:42:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 21:42:59,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:59,113 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:59,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 21:42:59,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:59,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:59,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-14 21:42:59,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:59,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096061064] [2022-04-14 21:42:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:59,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:42:59,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265050629] [2022-04-14 21:42:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:59,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:42:59,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 21:42:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:59,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:42:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:42:59,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-14 21:42:59,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {224#true} is VALID [2022-04-14 21:42:59,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-14 21:42:59,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-14 21:42:59,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID [2022-04-14 21:42:59,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 1) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {244#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:42:59,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(and (= main_~y~0 1) (= main_~x~0 1))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {244#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:42:59,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(and (= main_~y~0 1) (= main_~x~0 1))} [67] L34-1-->L35: Formula: (< |v_main_#t~post6_4| 1) InVars {main_#t~post6=|v_main_#t~post6_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {244#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:42:59,458 INFO L272 TraceCheckUtils]: 8: Hoare triple {244#(and (= main_~y~0 1) (= main_~x~0 1))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:42:59,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:42:59,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-14 21:42:59,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID [2022-04-14 21:42:59,468 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 21:42:59,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:42:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:42:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096061064] [2022-04-14 21:42:59,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:42:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265050629] [2022-04-14 21:42:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265050629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:42:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:42:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:42:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877648479] [2022-04-14 21:42:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:42:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 21:42:59,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:42:59,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:59,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:42:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:42:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:42:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:42:59,483 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,555 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-14 21:42:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:42:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 21:42:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:42:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-14 21:42:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-14 21:42:59,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-14 21:42:59,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:42:59,581 INFO L225 Difference]: With dead ends: 26 [2022-04-14 21:42:59,581 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 21:42:59,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 21:42:59,583 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:42:59,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:42:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 21:42:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 21:42:59,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:42:59,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 21:42:59,585 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 21:42:59,586 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 21:42:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,587 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 21:42:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:42:59,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:59,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 21:42:59,587 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 21:42:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:42:59,588 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 21:42:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:42:59,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:42:59,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:42:59,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:42:59,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:42:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 21:42:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-14 21:42:59,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-14 21:42:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:42:59,590 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-14 21:42:59,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 21:42:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 21:42:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 21:42:59,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:42:59,591 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:42:59,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 21:42:59,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 21:42:59,808 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:42:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:42:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times [2022-04-14 21:42:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:42:59,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137112678] [2022-04-14 21:42:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:59,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:42:59,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:42:59,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826583424] [2022-04-14 21:42:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:42:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:42:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:42:59,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:42:59,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 21:42:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:59,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 21:42:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:42:59,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:00,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {367#true} is VALID [2022-04-14 21:43:00,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 1) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {387#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:43:00,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {387#(and (= main_~y~0 1) (= main_~x~0 1))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {387#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:43:00,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(and (= main_~y~0 1) (= main_~x~0 1))} [67] L34-1-->L35: Formula: (< |v_main_#t~post6_4| 1) InVars {main_#t~post6=|v_main_#t~post6_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {387#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:43:00,112 INFO L272 TraceCheckUtils]: 8: Hoare triple {387#(and (= main_~y~0 1) (= main_~x~0 1))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {367#true} is VALID [2022-04-14 21:43:00,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {367#true} is VALID [2022-04-14 21:43:00,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#true} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,116 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {367#true} {387#(and (= main_~y~0 1) (= main_~x~0 1))} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {387#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-14 21:43:00,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {387#(and (= main_~y~0 1) (= main_~x~0 1))} [75] L35-1-->L34-3: Formula: (and (= v_main_~x~0_5 (+ (* v_main_~x~0_6 v_main_~z~0_5) 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-14 21:43:00,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-14 21:43:00,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_2| 1)) InVars {main_#t~post6=|v_main_#t~post6_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-14 21:43:00,119 INFO L272 TraceCheckUtils]: 16: Hoare triple {412#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~y~0_9 v_main_~z~0_8)) (* v_main_~x~0_9 v_main_~z~0_8) (* (- 1) v_main_~x~0_9) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:00,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:00,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 21:43:00,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 21:43:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:00,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:43:00,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 21:43:00,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 21:43:00,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:00,326 INFO L272 TraceCheckUtils]: 16: Hoare triple {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~y~0_9 v_main_~z~0_8)) (* v_main_~x~0_9 v_main_~z~0_8) (* (- 1) v_main_~x~0_9) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:00,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_2| 1)) InVars {main_#t~post6=|v_main_#t~post6_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-14 21:43:00,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-14 21:43:00,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [75] L35-1-->L34-3: Formula: (and (= v_main_~x~0_5 (+ (* v_main_~x~0_6 v_main_~z~0_5) 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {442#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-14 21:43:00,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {367#true} {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 21:43:00,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#true} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {367#true} is VALID [2022-04-14 21:43:00,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~x~0_8) (* (- 1) (* v_main_~y~0_8 v_main_~z~0_7)) 1 (* v_main_~x~0_8 v_main_~z~0_7)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {367#true} is VALID [2022-04-14 21:43:00,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [67] L34-1-->L35: Formula: (< |v_main_#t~post6_4| 1) InVars {main_#t~post6=|v_main_#t~post6_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 21:43:00,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 21:43:00,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 1) (= v_main_~x~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {452#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-14 21:43:00,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {367#true} is VALID [2022-04-14 21:43:00,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 21:43:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:00,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137112678] [2022-04-14 21:43:00,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:00,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826583424] [2022-04-14 21:43:00,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826583424] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 21:43:00,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 21:43:00,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-14 21:43:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669561531] [2022-04-14 21:43:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:43:00,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:00,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:00,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:00,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:43:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:43:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 21:43:00,356 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:00,466 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-14 21:43:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:43:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:43:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-14 21:43:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-14 21:43:00,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-14 21:43:00,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:00,521 INFO L225 Difference]: With dead ends: 23 [2022-04-14 21:43:00,522 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 21:43:00,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 21:43:00,522 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:00,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 21:43:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 21:43:00,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:00,523 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 21:43:00,523 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 21:43:00,524 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 21:43:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:00,524 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:43:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:00,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:00,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:00,524 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 21:43:00,524 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 21:43:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:00,524 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 21:43:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:00,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:00,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:00,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:00,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:00,525 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 21:43:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 21:43:00,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-14 21:43:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:00,525 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 21:43:00,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 21:43:00,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:00,530 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 21:43:00,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 21:43:00,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:00,742 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-14 21:43:00,743 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 21:43:00,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:43:00 BasicIcfg [2022-04-14 21:43:00,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 21:43:00,747 INFO L158 Benchmark]: Toolchain (without parser) took 2977.71ms. Allocated memory was 209.7MB in the beginning and 255.9MB in the end (delta: 46.1MB). Free memory was 186.9MB in the beginning and 148.1MB in the end (delta: 38.8MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,747 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 21:43:00,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.23ms. Allocated memory was 209.7MB in the beginning and 255.9MB in the end (delta: 46.1MB). Free memory was 186.6MB in the beginning and 229.7MB in the end (delta: -43.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,749 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 255.9MB. Free memory was 229.7MB in the beginning and 228.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,749 INFO L158 Benchmark]: RCFGBuilder took 294.95ms. Allocated memory is still 255.9MB. Free memory was 228.0MB in the beginning and 217.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,750 INFO L158 Benchmark]: IcfgTransformer took 22.10ms. Allocated memory is still 255.9MB. Free memory was 217.5MB in the beginning and 216.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,751 INFO L158 Benchmark]: TraceAbstraction took 2435.82ms. Allocated memory is still 255.9MB. Free memory was 215.4MB in the beginning and 148.1MB in the end (delta: 67.3MB). Peak memory consumption was 66.6MB. Max. memory is 8.0GB. [2022-04-14 21:43:00,752 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.09ms. Allocated memory is still 209.7MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.23ms. Allocated memory was 209.7MB in the beginning and 255.9MB in the end (delta: 46.1MB). Free memory was 186.6MB in the beginning and 229.7MB in the end (delta: -43.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 255.9MB. Free memory was 229.7MB in the beginning and 228.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 294.95ms. Allocated memory is still 255.9MB. Free memory was 228.0MB in the beginning and 217.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.10ms. Allocated memory is still 255.9MB. Free memory was 217.5MB in the beginning and 216.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2435.82ms. Allocated memory is still 255.9MB. Free memory was 215.4MB in the beginning and 148.1MB in the end (delta: 67.3MB). Peak memory consumption was 66.6MB. 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: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 69 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 4 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 21:43:00,778 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...